{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:21Z","timestamp":1750220781199,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T00:00:00Z","timestamp":1588464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-1657377"],"award-info":[{"award-number":["CCF-1657377"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            The known proofs of MA \u2286 PP incur a quadratic overhead in the running time. We prove that this quadratic overhead is necessary for black-box simulations; in particular, we obtain an oracle relative to which MA-TIME (\n            <jats:italic>t<\/jats:italic>\n            ) \u2288 P-TIME (\n            <jats:italic>o<\/jats:italic>\n            (\n            <jats:italic>t<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            )). We also show that 2-sided-error Merlin\u2013Arthur games can be simulated by 1-sided-error Arthur\u2013Merlin games with quadratic overhead. We also present a simple, query complexity based proof (provided by Mika G\u00f6\u00f6s) that there is an oracle relative to which MA \u2288 NP\n            <jats:sup>BPP<\/jats:sup>\n            (which was previously known to hold by a proof using generics).\n          <\/jats:p>","DOI":"10.1145\/3389399","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T22:58:44Z","timestamp":1588633124000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Quadratic Simulations of Merlin\u2013Arthur Games"],"prefix":"10.1145","volume":"12","author":[{"given":"Thomas","family":"Watson","sequence":"first","affiliation":[{"name":"University of Memphis, Memphis, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1490270.1490272"},{"volume-title":"Proceedings of the 16th Conference on Computational Complexity (CCC\u201901)","year":"2001","author":"Allender Eric","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1017"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_2_1_6_1","unstructured":"Neal Carothers. [n.d.]. A Short Course on Approximation Theory. Lecture notes. Retrieved from http:\/\/personal.bgsu.edu\/ carother\/Approx.html.  Neal Carothers. [n.d.]. A Short Course on Approximation Theory. Lecture notes. Retrieved from http:\/\/personal.bgsu.edu\/ carother\/Approx.html."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63449"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_33"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/050642228"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01111276"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00018-X"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1651"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90040-4"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.  Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.","DOI":"10.1017\/CBO9780511574948"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90044-3"},{"key":"e_1_2_1_17_1","unstructured":"Marvin Minsky and Seymour Papert. 1987. Perceptrons\u2014An Introduction to Computational Geometry. MIT Press.  Marvin Minsky and Seymour Papert. 1987. Perceptrons\u2014An Introduction to Computational Geometry. MIT Press."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1654"},{"key":"e_1_2_1_20_1","unstructured":"Theodore Rivlin. 1981. An Introduction to the Approximation of Functions. Dover.  Theodore Rivlin. 1981. An Introduction to the Approximation of Functions. Dover."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0703024"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050007"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/100785260"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1015704"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808762"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000012"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a001"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1992.215389"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1995.377047"},{"volume-title":"Provability, Complexity, Grammars. AMS Translations","series-title":"Series 2","author":"Vereshchagin Nikolai","key":"e_1_2_1_30_1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0267-3"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_62"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0248-y"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3389399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3389399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:31Z","timestamp":1750200091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3389399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,3]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3389399"],"URL":"https:\/\/doi.org\/10.1145\/3389399","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"type":"print","value":"1942-3454"},{"type":"electronic","value":"1942-3462"}],"subject":[],"published":{"date-parts":[[2020,5,3]]},"assertion":[{"value":"2017-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}