On the random oracle hypothesis
- 30 April 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 57 (1) , 40-47
- https://doi.org/10.1016/s0019-9958(83)80023-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- 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
- Bounded query machines: On NP() and NPQUERY()Theoretical Computer Science, 1981
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970