Limiting Negations in Constant Depth Circuits
- 1 April 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (2) , 294-302
- https://doi.org/10.1137/0222022
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Short monotone formulae for the majority functionPublished by Elsevier ,2004
- Symmetry Functions in AC° can be Computed in Constant Depth with Very Small SizePublished by Cambridge University Press (CUP) ,1992
- Monotone versus positiveJournal of the ACM, 1987
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- Threshold functions and bounded depth monotone circuitsJournal of Computer and System Sciences, 1986
- Sorting inc logn parallel stepsCombinatorica, 1983
- The complexity of negation-limited networks — A brief surveyPublished by Springer Nature ,1975
- On Maximum Inversion with Minimum InvertersIEEE Transactions on Computers, 1968