{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:52:21Z","timestamp":1787507541462,"version":"build-2736575974"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/s0022-0000(05)80026-1","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"183-193","source":"Crossref","is-referenced-by-count":21,"title":["PSPACE is provable by two provers in one round"],"prefix":"10.1016","volume":"48","author":[{"given":"Jin-yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anne","family":"Condon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80026-1_bib1","series-title":"Proceedings, 17th Annual Symposium on the Theory of Computing (STOC)","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/S0022-0000(05)80026-1_bib2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1988","journal-title":"J Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80026-1_bib3","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"},{"key":"10.1016\/S0022-0000(05)80026-1_bib4","series-title":"Proceedings, 7th Symposium on Theoretical Aspects of Computer Science","first-page":"37","article-title":"Hiding instances in mutioracle queries","volume":"Vol. 415","author":"Beaver","year":"1990"},{"key":"10.1016\/S0022-0000(05)80026-1_bib5","series-title":"Proceedings, 20th Annual Symposium on the theory of Computing (STOC)","first-page":"113","article-title":"Multi-prover interactive proofs: How to remove intractability","author":"Ben-Or","year":"1988"},{"key":"10.1016\/S0022-0000(05)80026-1_bib6_1","series-title":"Proceedings, Symposium on Theoretical Aspects of Computer Science","article-title":"Playing games of incomplete information","volume":"Vol. 415","author":"Cai","year":"1990"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80026-1_bib6_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(92)90085-T","volume":"103","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80026-1_bib7","series-title":"Proceedings, Fifth Annual Conference on Structure in Complexity Theory","first-page":"45","article-title":"On bounded round multi-prover interactive proof systems","author":"Cai","year":"1990"},{"key":"10.1016\/S0022-0000(05)80026-1_bib8","unstructured":"L. Fortnow, \u201cComplexity-Theoretic Aspects of Interactive Proof Systems,\u201d Ph.D. thesis, Tech. Report # MIT\/LCS\/TR-447, MIT."},{"key":"10.1016\/S0022-0000(05)80026-1_bib9","series-title":"Proceedings, Sixth Annual Conference on Structure in Complexity Theory","first-page":"116","article-title":"On the success probability of the two provers in one-round proof systems","author":"Feige","year":"1991"},{"key":"10.1016\/S0022-0000(05)80026-1_bib10","series-title":"Proceedings, 24th Annual Symposium on the Theory of Computing","first-page":"733","article-title":"Two-prover one-round proof systems: Their power and their problems","author":"Feige","year":"1992"},{"key":"10.1016\/S0022-0000(05)80026-1_bib11","series-title":"Proceedings, Third Annual Conference on Structure in Complexity Theory","first-page":"156","article-title":"On the power of multi-prover interactive protocols","author":"Fortnow","year":"1988"},{"key":"10.1016\/S0022-0000(05)80026-1_bib12","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)80026-1_bib13","series-title":"Randomness and Computation","first-page":"73","article-title":"Public coins vs. private coins in interactive proof systems","volume":"Vol. 5","author":"Goldwasser","year":"1989"},{"key":"10.1016\/S0022-0000(05)80026-1_bib14","series-title":"Proceedings, 32nd Annual IEEE Symposium on the Foundations of Computer Science","first-page":"13","article-title":"Fully parallelized multi prover protocols for NEXP-time","author":"Lapidot","year":"1991"},{"key":"10.1016\/S0022-0000(05)80026-1_bib15","series-title":"Distributed Computing and Cryptography","first-page":"191","article-title":"New directions in testing","volume":"Vol. 2","author":"Lipton","year":"1991"},{"issue":"4","key":"10.1016\/S0022-0000(05)80026-1_bib16","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0022-0000(05)80026-1_bib17","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1145\/146585.146609","article-title":"IP=PSPACE","volume":"39","author":"Shamir","year":"1992","journal-title":"J. ACM"},{"issue":"No. 5","key":"10.1016\/S0022-0000(05)80026-1_bib18","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80026-1_bib19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800261?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800261?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:46Z","timestamp":1548178066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["S0022000005800261"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80026-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}