Random oracles separate PSPACE from the polynomial-time hierarchy
- 1 September 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (1) , 51-53
- https://doi.org/10.1016/0020-0190(87)90036-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- research-articleThe Journal of Symbolic Logic, 1986
- ∑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
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975