{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:46:44Z","timestamp":1781030804560,"version":"3.54.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2005,8,19]],"date-time":"2005-08-19T00:00:00Z","timestamp":1124409600000},"content-version":"vor","delay-in-days":4036,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/s0022-0000(05)80084-4","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"24-39","source":"Crossref","is-referenced-by-count":31,"title":["The random oracle hypothesis is false"],"prefix":"10.1016","volume":"49","author":[{"given":"Richard","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Chor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juris","family":"Hartmanis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Desh","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pankaj","family":"Rohatgi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80084-4_bib1","series-title":"ACM Symposium on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80084-4_bib2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01200056","article-title":"Non-deterministic exponential time has two-prover interactive protocols","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80084-4_bib3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80084-4_bib4","series-title":"ACM Symposium on Theory of Computing","first-page":"113","article-title":"Multi-prover interactive proofs: How to remove the intractability assumptions","author":"Ben-Or","year":"1988"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80084-4_bib5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80084-4_bib6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80084-4_bib7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","article-title":"Does co-NP have short interactive proofs?","volume":"25","author":"Boppana","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80084-4_bib8","series-title":"ACM Symposium on Theory of Computing","first-page":"21","article-title":"With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy","author":"Cai","year":"1986"},{"key":"10.1016\/S0022-0000(05)80084-4_bib9","series-title":"4th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"148","article-title":"Probability one separation of the Boolean hierarchy","volume":"Vol. 247","author":"Cai","year":"1987"},{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80084-4_bib10","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","article-title":"The Boolean hierarchy. I. Structural properties","volume":"17","author":"Cai","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80084-4_bib11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/0218007","article-title":"The Boolean hierarchy. II. Applications","volume":"18","author":"Cai","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80084-4_bib12","article-title":"The Random Oracle Hypothesis Is False","author":"Chor","year":"1990"},{"key":"10.1016\/S0022-0000(05)80084-4_bib13","article-title":"Computational Models of Games","author":"Condon","year":"1988"},{"issue":"No. 5","key":"10.1016\/S0022-0000(05)80084-4_bib14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(88)90199-8","article-title":"Are there interactive protocols for co-NP languages?","volume":"28","author":"Fortnow","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80084-4_bib15","article-title":"More on the Random Oracle Hypothesis: What Is True Almost Always Is Not Necessarily So","author":"Gasarch","year":"1985"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80084-4_bib16","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80084-4_bib17","first-page":"691","article-title":"Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems","volume":"38","author":"Goldreich","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(05)80084-4_bib18","series-title":"Computational Complexity Theory","first-page":"108","article-title":"Interactive proof systems","volume":"Vol. 38","author":"Goldwasser","year":"1989"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80084-4_bib19","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80084-4_bib20","series-title":"ACM Symposium on Theory of Computing","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/S0022-0000(05)80084-4_bib21","first-page":"40","article-title":"Solvable problems with conflicting relativizations","volume":"27","author":"Hartmanis","year":"1985","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80084-4_bib22","series-title":"Proceedings, 2nd Scandinavian Workshop on Algorithm Theory","first-page":"1","article-title":"Structural complexity theory: Recent surprises","volume":"Vol. 447","author":"Hartmanis","year":"1990"},{"key":"10.1016\/S0022-0000(05)80084-4_bib23","series-title":"Randomness and Computation","first-page":"143","article-title":"Almost optimal lower bounds for small depth circuits","volume":"Vol. 5","author":"H\u00e5stad","year":"1989"},{"key":"10.1016\/S0022-0000(05)80084-4_bib24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/scientificamerican0584-86","article-title":"Turing machines","author":"Hopcroft","year":"1984","journal-title":"Sci. Amer."},{"key":"10.1016\/S0022-0000(05)80084-4_bib25","series-title":"NP in zero-knowledge fails with respect to random oracle, personal communication","author":"Impagliazzo","year":"1990"},{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80084-4_bib26","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0217080","article-title":"The polynomial time hierarchy collapses if the Boolean hierarchy collapses","volume":"17","author":"Kadin","year":"1988","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0022-0000(05)80084-4_bib27","series-title":"ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0022-0000(05)80084-4_bib28","series-title":"ACM Symposium on Theory of Computing","first-page":"245","article-title":"Relativized polynomial time hierarchies having exactly k levels","author":"Ko","year":"1988"},{"key":"10.1016\/S0022-0000(05)80084-4_bib29","series-title":"ACM Symposium on Theory of Computing","first-page":"224","article-title":"On the random oracle hypothesis","author":"Kurtz","year":"1982"},{"key":"10.1016\/S0022-0000(05)80084-4_bib30","series-title":"ACM Symposium on Theory of Computing","first-page":"157","article-title":"The isomorphism conjecture fails relative to a random oracle","author":"Kurtz","year":"1989"},{"key":"10.1016\/S0022-0000(05)80084-4_bib31","series-title":"Proceedings, IEEE Symposium on Foundations of Computer Science","first-page":"2","article-title":"Algebraic methods for interactive proof systems","author":"Lund","year":"1990"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80084-4_bib32","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80084-4_bib33","series-title":"Proceedings, IEEE Symposium on Foundations of Computer Science","first-page":"446","article-title":"Games against nature","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/S0022-0000(05)80084-4_bib34","series-title":"Proceedings, IEEE Symposium on Foundations of Computer Science","first-page":"11","article-title":"IP = PSPACE","author":"Shamir","year":"1990"},{"key":"10.1016\/S0022-0000(05)80084-4_bib35","series-title":"Proceedings, IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800844?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800844?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T19:11:44Z","timestamp":1647457904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["S0022000005800844"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80084-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}