{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:20:04Z","timestamp":1648884004652},"reference-count":27,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,2]]},"abstract":"<jats:p> We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP, R and coR. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy. <\/jats:p>","DOI":"10.1142\/s0129054104002273","type":"journal-article","created":{"date-parts":[[2004,3,18]],"date-time":"2004-03-18T12:03:47Z","timestamp":1079611427000},"page":"3-19","source":"Crossref","is-referenced-by-count":0,"title":["ON HIGHER ARTHUR-MERLIN CLASSES"],"prefix":"10.1142","volume":"15","author":[{"given":"JIN-YI","family":"CAI","sequence":"first","affiliation":[{"name":"Computer Sciences Department, University of Wisconsin, Madison, Wisconsin 53706, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DENIS","family":"CHARLES","sequence":"additional","affiliation":[{"name":"Computer Sciences Department, University of Wisconsin, Madison, Wisconsin 53706, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"PAVAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Iowa State University, Ames, Iowa 50011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SAMIK","family":"SENGUPTA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, New York 14260, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00164-4"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_36"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798343647"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97062-7"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"rf15","first-page":"40","volume":"55","author":"Canetti R.","journal-title":"Information Processing Letters"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1686"},{"key":"rf20","volume":"4","author":"Goldreich O.","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054100000181"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3544-4"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60084-1_74"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90006-I"},{"key":"rf26","volume-title":"Computational Complexity","author":"Papadimitrou C.","year":"1992"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050007"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90010-4"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90020-2"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054193000195"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1109"},{"key":"rf35","first-page":"205","volume":"100","author":"Watanabe O.","journal-title":"Theoretical Computer Science"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90040-6"},{"key":"rf37","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80044-4"},{"key":"rf38","unstructured":"S.\u00a0Zachos and M.\u00a0F\u00fcrer, Proc. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 287 (Springer-Verlag, 1987)\u00a0pp. 449\u2013455."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:25:29Z","timestamp":1565191529000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":27,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,2]]}},"alternative-id":["10.1142\/S0129054104002273"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002273","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}