On the power of small-depth threshold circuits
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 610-618
- https://doi.org/10.1109/fscs.1990.89582
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Log Depth Circuits For Division And Related ProblemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics, 1990
- Monotone circuits for matching require linear depthPublished by Association for Computing Machinery (ACM) ,1990
- Circuits and local computationPublished by Association for Computing Machinery (ACM) ,1989
- Multiparty protocols and logspace-hard pseudorandom sequencesPublished by Association for Computing Machinery (ACM) ,1989
- Probabilistic communication complexity of Boolean relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Algebraic methods in the theory of lower bounds for Boolean circuit complexityPublished by Association for Computing Machinery (ACM) ,1987
- Lower bounds on monotone complexity of the logical permanentMathematical Notes, 1985
- Separating the polynomial-time hierarchy by oraclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985