Abstract
The known proofs of MA ⊆ 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 (t) ⊈ P-TIME (o(t2)). We also show that 2-sided-error Merlin–Arthur games can be simulated by 1-sided-error Arthur–Merlin games with quadratic overhead. We also present a simple, query complexity based proof (provided by Mika Göös) that there is an oracle relative to which MA ⊈ NPBPP (which was previously known to hold by a proof using generics).
- Scott Aaronson and Avi Wigderson. 2009. Algebrization: A new barrier in complexity theory. ACM Trans. Comput. Theor. 1, 1 (2009), 2:1--2:54. DOI:https://doi.org/10.1145/1490270.1490272Google Scholar
Digital Library
- Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, and V. Vinay. 2001. Time-space tradeoffs in the counting hierarchy. In Proceedings of the 16th Conference on Computational Complexity (CCC’01). IEEE, 295--302. DOI:https://doi.org/10.1109/CCC.2001.933896Google Scholar
- László Babai. 1985. Trading group theory for randomness. In Proceedings of the 17th Symposium on Theory of Computing (STOC’85). ACM, 421--429. DOI:https://doi.org/10.1145/22145.22192Google Scholar
Digital Library
- Richard Beigel, Nick Reingold, and Daniel Spielman. 1995. PP is closed under intersection. J. Comput. Syst. Sci. 50, 2 (1995), 191--202. DOI:https://doi.org/10.1006/jcss.1995.1017Google Scholar
Digital Library
- Harry Buhrman and Ronald de Wolf. 2002. Complexity measures and decision tree complexity: A survey. Theor. Comput. Sci. 288, 1 (2002), 21--43. DOI:https://doi.org/10.1016/S0304-3975(01)00144-XGoogle Scholar
Digital Library
- Neal Carothers. [n.d.]. A Short Course on Approximation Theory. Lecture notes. Retrieved from http://personal.bgsu.edu/ carother/Approx.html.Google Scholar
- Aviad Cohen and Avi Wigderson. 1989. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS’89). IEEE, 14--19. DOI:https://doi.org/10.1109/SFCS.1989.63449Google Scholar
Digital Library
- Scott Diehl. 2007. Lower bounds for swapping Arthur and Merlin. In Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM’07). Springer, 449--463. DOI:https://doi.org/10.1007/978-3-540-74208-1_33Google Scholar
Digital Library
- Scott Diehl and Dieter van Melkebeek. 2006. Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM J. Comput. 36, 3 (2006), 563--594. DOI:https://doi.org/10.1137/050642228Google Scholar
Digital Library
- Hartmut Ehlich and Karl Zeller. 1964. Schwankung von Polynomen zwischen Gitterpunkten. Math. Zeitschr. 86, 1 (1964), 41--44.Google Scholar
Cross Ref
- Stephen Fenner, Lance Fortnow, Stuart Kurtz, and Lide Li. 2003. An oracle builder’s toolkit. Inf. Comput. 182, 2 (2003), 95--136. DOI:https://doi.org/10.1016/S0890-5401(03)00018-XGoogle Scholar
Digital Library
- Lance Fortnow and John Rogers. 1999. Complexity limitations on quantum computation. J. Comput. Syst. Sci. 59, 2 (1999), 240--252. DOI:https://doi.org/10.1006/jcss.1999.1651Google Scholar
Digital Library
- Ofer Gabber and Zvi Galil. 1981. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 3 (1981), 407--420. DOI:https://doi.org/10.1016/0022-0000(81)90040-4Google Scholar
Cross Ref
- Russell Impagliazzo and David Zuckerman. 1989. How to recycle random bits. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS’89). IEEE, 248--253. DOI:https://doi.org/10.1109/SFCS.1989.63486Google Scholar
Digital Library
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.Google Scholar
- Clemens Lautemann. 1983. BPP and the polynomial hierarchy. Inf. Process. Lett. 17, 4 (1983), 215--217. DOI:https://doi.org/10.1016/0020-0190(83)90044-3Google Scholar
Cross Ref
- Marvin Minsky and Seymour Papert. 1987. Perceptrons—An Introduction to Computational Geometry. MIT Press.Google Scholar
- Noam Nisan and Mario Szegedy. 1994. On the degree of Boolean functions as real polynomials. Comput. Complex. 4, 4 (1994), 301--313. DOI:https://doi.org/10.1007/BF01263419Google Scholar
Digital Library
- Ran Raz, Gábor Tardos, Oleg Verbitsky, and Nikolai Vereshchagin. 1999. Arthur–Merlin games in boolean decision trees. J. Comput. Syst. Sci. 59, 2 (1999), 346--372. DOI:https://doi.org/10.1006/jcss.1999.1654Google Scholar
Digital Library
- Theodore Rivlin. 1981. An Introduction to the Approximation of Functions. Dover.Google Scholar
- Theodore Rivlin and Elliot Ward Cheney. 1966. A comparison of uniform approximations on an interval and a finite subset thereof. SIAM J. Numer. Anal. 3, 2 (1966), 311--320.Google Scholar
Digital Library
- Alexander Russell and Ravi Sundaram. 1998. Symmetric alternation captures BPP. Comput. Complex. 7, 2 (1998), 152--162. DOI:https://doi.org/10.1007/s000370050007Google Scholar
Digital Library
- Alexander Sherstov. 2013. The intersection of two halfspaces has high threshold degree. SIAM J. Comput. 42, 6 (2013), 2329--2374. DOI:https://doi.org/10.1137/100785260Google Scholar
Cross Ref
- Alexander Sherstov. 2018. Breaking the Minsky–Papert barrier for constant-depth circuits. SIAM J. Comput. 47, 5 (2018), 1809--1857. DOI:https://doi.org/10.1137/15M1015704Google Scholar
Cross Ref
- Michael Sipser. 1983. A complexity theoretic approach to randomness. In Proceedings of the 15th Symposium on Theory of Computing (STOC’83). ACM, 330--335. DOI:https://doi.org/10.1145/800061.808762Google Scholar
Digital Library
- Dieter van Melkebeek. 2006. A survey of lower bounds for satisfiability and related problems. Found. Trends Theor. Comput. Sci. 2, 3 (2006), 197--303. DOI:https://doi.org/10.1561/0400000012Google Scholar
Digital Library
- Dieter van Melkebeek and Thomas Watson. 2012. Time-space efficient simulations of quantum computations. Theor. Comput. 8, 1 (2012), 1--51. DOI:https://doi.org/10.4086/toc.2012.v008a001Google Scholar
Cross Ref
- Nikolai Vereshchagin. 1992. On the power of PP. In Proceedings of the 7th Structure in Complexity Theory Conference (STRUCTURES’92). IEEE, 138--143. DOI:https://doi.org/10.1109/SCT.1992.215389Google Scholar
Cross Ref
- Nikolai Vereshchagin. 1995. Lower bounds for perceptrons solving some separation problems and oracle separation of AM from PP. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (ISTCS’95). IEEE, 46--51. DOI:https://doi.org/10.1109/ISTCS.1995.377047Google Scholar
Cross Ref
- Nikolai Vereshchagin. 1999. Relativizability in complexity theory. In Provability, Complexity, Grammars. AMS Translations, Series 2, Vol. 192. American Mathematical Society, 87--172.Google Scholar
- Emanuele Viola. 2009. On approximate majority and probabilistic time. Comput. Complex. 18, 3 (2009), 337--375. DOI:https://doi.org/10.1007/s00037-009-0267-3Google Scholar
Digital Library
- Thomas Watson. 2018. Quadratic simulations of Merlin–Arthur games. In Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN’18). Springer, 864--872. DOI:https://doi.org/10.1007/978-3-319-77404-6_62Google Scholar
Cross Ref
- Ryan Williams. 2008. Time-space tradeoffs for counting NP solutions modulo integers. Comput. Complex. 17, 2 (2008), 179--219. DOI:https://doi.org/10.1007/s00037-008-0248-yGoogle Scholar
Digital Library
Index Terms
Quadratic Simulations of Merlin–Arthur Games
Recommendations
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
In several settings, derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence of pseudorandom generators. This leaves open the question whether derandomization implies the circuit lower bounds that are ...
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)Hardness against nondeterministic circuits is known to suffice for derandomizing Arthur-Merlin games. We show a result in the other direction - that hardness against nondeterministic circuits is *necessary* for derandomizing Arthur-Merlin games. In fact,...
Generalized quantum arthur-merlin games
CCC '15: Proceedings of the 30th Conference on Computational ComplexityThis paper investigates the role of interaction and coins in quantum Arthur-Merlin games(also called public-coin quantum interactive proof systems). While the existing model restricts the messages from the verifier to be classical even in the quantum ...






Comments