ON ACC and threshold circuits
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 619-627
- https://doi.org/10.1109/fscs.1990.89583
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the power of uniform families of constant depth threshold circuitsPublished by Springer Nature ,2005
- On the power of small-depth threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiparty protocols and logspace-hard pseudorandom sequencesPublished by Association for Computing Machinery (ACM) ,1989
- On the computational power of PP and (+)PPublished 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
- Constant depth circuits, Fourier transform, and learnabilityPublished 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
- NP is as easy as detecting unique solutionsTheoretical Computer Science, 1986
- Separating the polynomial-time hierarchy by oraclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981