Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1), 96-113
- https://doi.org/10.1137/0210008
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- On Almost Everywhere Complex Recursive FunctionsJournal of the ACM, 1974