Probabilistic complexity classes and lowness
Author:
- Uwe SchöningUSUwe Schöning
- 1 August 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (1) , 84-100
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Generalized lowness and highness and probabilistic complexity classesTheory of Computing Systems, 1989
- Probabilistic complexity classes and lownessJournal of Computer and System Sciences, 1989
- Graph isomorphism is in the low hierarchyJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- On small generatorsTheoretical Computer Science, 1984
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976