{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:56:01Z","timestamp":1781078161554,"version":"3.54.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,5]]},"DOI":"10.1016\/0020-0190(87)90232-8","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T20:00:31Z","timestamp":1049486431000},"page":"127-132","source":"Crossref","is-referenced-by-count":257,"title":["Does co-NP have short interactive proofs?"],"prefix":"10.1016","volume":"25","author":[{"given":"Ravi B.","family":"Boppana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Hastad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90232-8_BIB1","series-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science","first-page":"368","article-title":"On the power of interaction","author":"Aiello","year":"1986"},{"key":"10.1016\/0020-0190(87)90232-8_BIB2","series-title":"Proc. 17th ACM Symp. on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"issue":"1","key":"10.1016\/0020-0190(87)90232-8_BIB3","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\/0020-0190(87)90232-8_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0020-0190(87)90232-8_BIB5","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"144","article-title":"Probabilistic game automata","volume":"Vol. 223","author":"Condon","year":"1986"},{"key":"10.1016\/0020-0190(87)90232-8_BIB6","unstructured":"L. Fortnow and M. Sipser, Private communication."},{"issue":"4","key":"10.1016\/0020-0190(87)90232-8_BIB7","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."},{"key":"10.1016\/0020-0190(87)90232-8_BIB8","series-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science","first-page":"174","article-title":"Proofs that yield nothing but their validity and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986"},{"key":"10.1016\/0020-0190(87)90232-8_BIB9","series-title":"Proc. 17th ACM Symp. on Theory of Computing","first-page":"291","article-title":"The knowledge complexity of interactive proof systems","author":"Goldwasser","year":"1985"},{"key":"10.1016\/0020-0190(87)90232-8_BIB10","series-title":"Proc. 18th ACM Symp. 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\/0020-0190(87)90232-8_BIB11","series-title":"Proc. Oberwolfach Recursion-Theoretic Week","first-page":"159","article-title":"Probabilistic machines, oracles and quantifiers","volume":"Vol. 1141","author":"Hinman","year":"1984"},{"issue":"1","key":"10.1016\/0020-0190(87)90232-8_BIB12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","article-title":"Some observations on probabilistic algorithms and NP-hard problems","volume":"14","author":"Ko","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90232-8_BIB13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A low and high hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(87)90232-8_BIB14","series-title":"Graph isomorphism is in the low hierarchy","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0020-0190(87)90232-8_BIB15","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"issue":"1","key":"10.1016\/0020-0190(87)90232-8_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(87)90232-8_BIB17","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"383","article-title":"Probabilistic quantifiers, adversaries, and complexity classes: An overview","volume":"Vol. 223","author":"Zachos","year":"1986"},{"key":"10.1016\/0020-0190(87)90232-8_BIB18","series-title":"Probabilistic quantifiers vs. distrustful adversaries","author":"Zachos","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T01:26:23Z","timestamp":1553390783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087902328"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90232-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}