On the power of uniform families of constant depth threshold circuits
- 11 June 2005
- book chapter
- Published by Springer Nature
- p. 158-164
- https://doi.org/10.1007/bfb0029603
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- P-uniform circuit complexityJournal of the ACM, 1989
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Parallel computation with threshold functionsJournal of Computer and System Sciences, 1988
- Hardness vs. randomnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Threshold circuits of bounded depthPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Algebraic methods in the theory of lower bounds for Boolean circuit complexityPublished by Association for Computing Machinery (ACM) ,1987
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- A complexity theoretic approach to randomnessPublished by Association for Computing Machinery (ACM) ,1983
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978