The random oracle hypothesis is false
Open Access
- 19 August 1994
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 49 (1) , 24-39
- https://doi.org/10.1016/s0022-0000(05)80084-4
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Probability one separation of the Boolean hierarchyPublished by Springer Nature ,2006
- The random oracle hypothesis is falseJournal of Computer and System Sciences, 1994
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Turing MachinesScientific American, 1984
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- 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
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977