A Catalog of Complexity Classes
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 177 references indexed in Scilit:
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- The complexity of parallel searchJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Games against natureJournal of Computer and System Sciences, 1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- Polynomial time computations in models of ETJournal of Computer and System Sciences, 1983
- CorrigendumJournal of Computer and System Sciences, 1982
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976