With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
- 1 February 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 38 (1) , 68-85
- https://doi.org/10.1016/0022-0000(89)90033-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The boolean hierarchy: Hardware over NPPublished by Springer Nature ,1986
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- 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
- AlternationJournal of the ACM, 1981
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975