{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:31Z","timestamp":1742617111276,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544876"},{"type":"electronic","value":"9783540384014"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54487-9_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:54:20Z","timestamp":1330210460000},"page":"261-273","source":"Crossref","is-referenced-by-count":0,"title":["Interactive proof systems: Provers, rounds, and error bounds"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hertrampf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai. Trading group theory for randomness. 17th Annual ACM Symposium on Theory of Computing (STOC), 421\u2013429, 1985.","DOI":"10.1145\/22145.22192"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai. E-mail and the unexpected power of interaction. 5th Structure in Complexity Theory (IEEE), 30\u201344, 1990.","DOI":"10.1109\/SCT.1990.113952"},{"key":"15_CR3","unstructured":"L. Babai, L. Fortnow, C. Lund. Non-deterministic exponential time has two-prover interactive protocols. University of Chicago Technical Report 90-03, 1990."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson. Multi-prover interactive proofs: How to remove the intractability assumptions. 20th Annual ACM Symposium on Theory of Computing (STOC), 113\u2013131, 1988.","DOI":"10.1145\/62212.62223"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. H\u00e5stad, S. Zachos. Does co-NP have short interactive proofs? Information Processing Letters 25, 127\u2013132, 1987.","journal-title":"Information Processing Letters"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"L. Babai, S. Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Science 36 2, 254\u2013276, 1988.","journal-title":"Journal of Computer and System Science"},{"key":"15_CR7","unstructured":"J. Cai, A. Condon, R. Lipton. PSPACE is provable by two provers in one round. Manuscript, 1990."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, M. Sipser. On the power of multi-prover interactive protocols. 3rd Structure in Complexity Theory (IEEE), 156\u2013161, 1988.","DOI":"10.1109\/SCT.1988.5275"},{"key":"15_CR9","unstructured":"L. Fortnow, J. Rompel, M. Sipser. Errata for on the power of multi-prover interactive protocols. 5th Structure in Complexity Theory (IEEE), 318\u2013319, 1990."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(88)90199-8","volume":"28","author":"L. Fortnow","year":"1988","unstructured":"L. Fortnow, M. Sipser. Are there interactive protocols for co-NP languages? Information Processing Letters 28, 249\u2013251, 1988.","journal-title":"Information Processing Letters"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. The knowledge complexity of interactive proof systems. 17th Annual ACM Symposium on Theory of Computing (STOC), 291\u2013304, 1985.","DOI":"10.1145\/22145.22178"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, M. Sipser. Private coins versus public coins in interactive proof systems. 18th Annual ACM Symposium on Theory of Computing (STOC), 59\u201368, 1986.","DOI":"10.1145\/12130.12137"},{"key":"15_CR13","unstructured":"C. Lund, L. Fortnow, H. Karloff, N. Nisan. The polynomial time hierarchy has interactive proofs. E-mail announcement, 1989."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning. Complexity and Structure. Springer-Verlag Lecture Notes in Computer Science 211, 1986.","DOI":"10.1007\/3-540-16079-5"},{"key":"15_CR15","unstructured":"A. Shamir. IP = PSPACE. E-mail announcement, 1989, also in 31st Annual Symposium on Foundations of Computer Science (FOCS), 11\u201315, 1990."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54487-9_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:19:35Z","timestamp":1742591975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54487-9_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544876","9783540384014"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54487-9_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}