On sparse oracles separating feasible complexity classes
- 1 August 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (6) , 291-295
- https://doi.org/10.1016/0020-0190(88)90176-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Continuous optimization problems and a polynomial hierarchy of real functionsJournal of Complexity, 1985
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Positive Relativizations of Complexity ClassesSIAM Journal on Computing, 1983
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975