Strong and robustly strong polynomial-time reducibilities to sparse sets
Authors:
- 30 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 88 (1) , 1-14
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Relativizing complexity classes with sparse oraclesJournal of the ACM, 1986
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- Qualitative relativizations of complexity classesJournal of Computer and System Sciences, 1985
- On small generatorsTheoretical Computer Science, 1984
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- 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
- On sparse sets in NP–PInformation Processing Letters, 1983
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- The polynomial-time hierarchyTheoretical Computer Science, 1976