The Random Oracle Hypothesis Is False

[1]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[2]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[3]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Desh Ranjan,et al.  Structural Complexity Theory: recent Surprises , 1990, SWAT.

[5]  Ronald V. Book.  On separating complexity classes , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[6]  Anne Condon,et al.  Computational models of games , 1989, ACM distinguished dissertations.

[7]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

[8]  Stuart A. Kurtz,et al.  The ismorphism conjecture fails relative to a random oracle , 1989, STOC '89.

[9]  Stuart A. Kurtz,et al.  The isomorphic conjecture fails relative to a random oracle , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[10]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[11]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[12]  Lance Fortnow,et al.  Are There Interactive Protocols for CO-NP Languages? , 1988, Inf. Process. Lett..

[13]  Jim Kadin.  The polynomial time hierarchy collapses if the Boolean hierarchy collapses , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[14]  Ker-I Ko.  Relativized polynomial time hierarchies having exactly K levels , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[15]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[16]  Jin-Yi Cai.  Probability One Separation of the Boolean Hierarchy , 1987, STACS.

[17]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[18]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[19]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[20]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[21]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[22]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[23]  Juris Hartmanis.  Solvable problems with conflicting relativizations , 1985, Bull. EATCS.

[24]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[25]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Stuart A. Kurtz,et al.  On the random oracle hypothesis , 1982, STOC '82.

[27]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[28]  Stephen R. Mahaney.  Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[29]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[30]  Juris Hartmanis,et al.  On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[31]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[32]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[33]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.