{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:55Z","timestamp":1725663175849},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_66","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:41:04Z","timestamp":1330198864000},"page":"435-442","source":"Crossref","is-referenced-by-count":1,"title":["Relativized Arthur-Merlin versus Merlin-Arthur games"],"prefix":"10.1007","author":[{"given":"Miklos","family":"Santha","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Aiello W., Goldwasser S. and Hastad J., \"On the Power of Interaction\", Proc. 27th FOCS, 1986, pp. 368\u2013379.","DOI":"10.1109\/SFCS.1986.36"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Babai L., \"Trading Group Theory for Randomness\", Proc. 17th STOC, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"30_CR3","unstructured":"Boppana R. and Hastad J., \"Does co-NP Have Short Interactive Proofs\", submitted to Information Processing Letters."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","volume":"8","author":"T. Baker","year":"1979","unstructured":"Baker T. and Selman A., \"A Second Step Toward the Polynomial Hierarchy\", TCS 8, 1979, pp. 177\u2013187.","journal-title":"TCS"},{"key":"30_CR5","unstructured":"Fortnow L. and Sipser M., reported in [GS]."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Micali S. and Rackoff C., \"The Knowledge Complexity of Interactive Proofs\", Proc. 17th STOC, 1985, pp. 291\u2013305.","DOI":"10.1145\/22145.22178"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Goldwasser S. and Sipser M., \"Private Coins versus Public Coins in Interactive Proof Systems\", Proc. 18th STOC, 1986, pp. 59\u201368.","DOI":"10.1145\/12130.12137"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Zachos S., \"Probabilistic Quantifiers, Adversaries and Complexity Classes: An Overview\" in Structure in Complexity Theory, ed. Selman A., Springer-Verlag, 1986, pp.383\u2013400.","DOI":"10.1007\/3-540-16486-3_112"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:17Z","timestamp":1605644117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}