{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T21:41:12Z","timestamp":1705095672464},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0890-5401(89)90022-9","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"44-49","source":"Crossref","is-referenced-by-count":17,"title":["Relativized Arthur-Merlin versus Merlin-Arthur games"],"prefix":"10.1016","volume":"80","author":[{"given":"Miklos","family":"Santha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90022-9_BIB1","series-title":"Proceedings, 27th FOCS","first-page":"368","article-title":"On the power of interaction","author":"Aiello","year":"1986"},{"key":"10.1016\/0890-5401(89)90022-9_BIB2","series-title":"Proceedings, 17th STOC","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0890-5401(89)90022-9_BIB3","article-title":"Does co-NP have short interactive proofs","author":"Boppana","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90022-9_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step toward the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90022-9_BIB5","series-title":"Proceedings, 17th STOC","first-page":"291","article-title":"The knowledge complexity of interactive proofs","author":"Goldwasser","year":"1985"},{"key":"10.1016\/0890-5401(89)90022-9_BIB6","series-title":"Proceedings, 18th STOC","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0890-5401(89)90022-9_BIB7","series-title":"Structure in Complexity Theory","first-page":"383","article-title":"Probabilistic quantifiers, adversaries and complexity classes: An overview","author":"Zachos","year":"1986"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:27:44Z","timestamp":1549045664000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0890540189900229"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90022-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}