On ACC
- 1 December 1994
- journal article
- Published by Springer Nature in computational complexity
- Vol. 4 (4) , 350-366
- https://doi.org/10.1007/bf01263423
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Quasipolynomial size circuit classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The power of the middle bitPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The polynomial method in circuit complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Counting classes: thresholds, parity, mods, and fewnessTheoretical Computer Science, 1992
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Finite monoids and the fine structure of NC 1Journal of the ACM, 1988
- 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