A note on sparse oracles for NP
Author:
- 30 April 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 24 (2) , 224-232
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- The equivalence problem for regular expressions with squaring requires exponential space1972