Relativizations comparing NP and exponential time
Open Access
- 1 July 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3) , 88-100
- https://doi.org/10.1016/s0019-9958(83)80058-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972