Relativized Questions Involving Probabilistic Algorithms
- 1 January 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (1) , 261-268
- https://doi.org/10.1145/322290.322306
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- 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
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975