On the power of small-depth threshold circuits
- 1 June 1991
- journal article
- Published by Springer Nature in computational complexity
- Vol. 1 (2) , 113-129
- https://doi.org/10.1007/bf01272517
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Log Depth Circuits For Division And Related ProblemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the power of small-depth threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Monotone circuits for connectivity require super-logarithmic depthPublished by Association for Computing Machinery (ACM) ,1988
- Threshold circuits of bounded depthPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983