Quasipolynomial size circuit classes
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- On ACCcomputational complexity, 1994
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Non-uniform automata over groupsInformation and Computation, 1990
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Finite monoids and the fine structure of NC 1Journal of the ACM, 1988
- Lower bounds on the size of bounded depth circuits over a complete basis with logical additionMathematical Notes, 1987
- NP is as easy as detecting unique solutionsTheoretical Computer Science, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983