Advertisement

Quadratic Simulations of Merlin–Arthur Games

  • Thomas Watson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)

Abstract

The known proofs of \(\textsf {MA}\subseteq \textsf {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 \({\textsf {MA}\text {-}\textsf {TIME}(t)\not \subseteq \textsf {P}\text {-}\textsf {TIME}(o(t^2))}\). 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 \(\textsf {MA}\not \subseteq \textsf {NP}^\textsf {BPP}\) (which was previously known to hold by a proof using generics).

Notes

Acknowledgments

I thank Mika Göös for suggesting the proof of Lemma 5, and anonymous reviewers for helpful comments.

References

  1. [AKR+01]
    Allender, E., Koucký, M., Ronneburger, D., Roy, S., Vinay, V.: Time-space tradeoffs in the counting hierarchy. In: Proceedings of the 16th Conference on Computational Complexity (CCC), pp. 295–302. IEEE (2001).  https://doi.org/10.1109/CCC.2001.933896
  2. [AW09]
    Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theor. 1(1), 2:1–2:54 (2009).  https://doi.org/10.1145/1490270.1490272 CrossRefzbMATHGoogle Scholar
  3. [Bab85]
    Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th Symposium on Theory of Computing (STOC), pp. 421–429. ACM (1985).  https://doi.org/10.1145/22145.22192
  4. [BRS95]
    Beigel, R., Reingold, N., Spielman, D.: PP is closed under intersection. J. Comput. Syst. Sci. 50(2), 191–202 (1995).  https://doi.org/10.1006/jcss.1995.1017 MathSciNetCrossRefzbMATHGoogle Scholar
  5. [Car]
    Carothers, N.: A short course on approximation theory. Lecture notes. http://personal.bgsu.edu/~carother/Approx.html
  6. [CW89]
    Cohen, A., Wigderson, A.: Dispersers, deterministic amplification, and weak random sources. In: Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pp. 14–19. IEEE (1989).  https://doi.org/10.1109/SFCS.1989.63449
  7. [Die07]
    Diehl, S.: Lower bounds for swapping Arthur and Merlin. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX/RANDOM 2007. LNCS, vol. 4627, pp. 449–463. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-74208-1_33 CrossRefGoogle Scholar
  8. [Dv06]
    Diehl, S., van Melkebeek, D.: Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM J. Comput. 36(3), 563–594 (2006).  https://doi.org/10.1137/050642228 MathSciNetCrossRefzbMATHGoogle Scholar
  9. [EZ64]
    Ehlich, H., Zeller, K.: Schwankung von polynomen zwischen gitterpunkten. Mathematische Zeitschrift 86, 41–44 (1964)MathSciNetCrossRefzbMATHGoogle Scholar
  10. [FFKL03]
    Fenner, S., Fortnow, L., Kurtz, S., Li, L.: An oracle builder’s toolkit. Inf. Comput. 182(2), 95–136 (2003).  https://doi.org/10.1016/S0890-5401(03)00018-X MathSciNetCrossRefzbMATHGoogle Scholar
  11. [FR99]
    Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. J. Comput. Syst. Sci. 59(2), 240–252 (1999).  https://doi.org/10.1006/jcss.1999.1651 MathSciNetCrossRefzbMATHGoogle Scholar
  12. [GG81]
    Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22(3), 407–420 (1981).  https://doi.org/10.1016/0022-0000(81)90040-4 MathSciNetCrossRefzbMATHGoogle Scholar
  13. [IZ89]
    Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pp. 248–253. IEEE (1989).  https://doi.org/10.1109/SFCS.1989.63486
  14. [KN97]
    Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)CrossRefzbMATHGoogle Scholar
  15. [Lau83]
    Lautemann, C.: BPP and the polynomial hierarchy. Inf. Process. Lett. 17(4), 215–217 (1983).  https://doi.org/10.1016/0020-0190(83)90044-3 MathSciNetCrossRefzbMATHGoogle Scholar
  16. [RC66]
    Rivlin, T., Cheney, E.W.: A comparison of uniform approximations on an interval and a finite subset thereof. SIAM J. Numer. Anal. 3(2), 311–320 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  17. [Riv81]
    Rivlin, T.: An Introduction to the Approximation of Functions. Dover, New York City (1981)zbMATHGoogle Scholar
  18. [RS98]
    Russell, A., Sundaram, R.: Symmetric alternation captures BPP. Comput. Complex. 7(2), 152–162 (1998).  https://doi.org/10.1007/s000370050007 MathSciNetCrossRefzbMATHGoogle Scholar
  19. [RTVV99]
    Raz, R., Tardos, G., Verbitsky, O., Vereshchagin, N.: Arthur-Merlin games in Boolean decision trees. J. Comput. Syst. Sci. 59(2), 346–372 (1999).  https://doi.org/10.1006/jcss.1999.1654 MathSciNetCrossRefzbMATHGoogle Scholar
  20. [She13]
    Sherstov, A.: The intersection of two halfspaces has high threshold degree. SIAM J. Comput. 42(6), 2329–2374 (2013).  https://doi.org/10.1137/100785260 MathSciNetCrossRefzbMATHGoogle Scholar
  21. [Sip83]
    Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the 15th Symposium on Theory of Computing (STOC), pp. 330–335. ACM (1983).  https://doi.org/10.1145/800061.808762
  22. [Ver92]
    Vereshchagin, N.: On the power of PP. In: Proceedings of the 7th Structure in Complexity Theory Conference (STRUCTURES), pp. 138–143. IEEE (1992).  https://doi.org/10.1109/SCT.1992.215389
  23. [Ver95]
    Vereshchagin, N.: 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), pp. 46–51. IEEE (1995).  https://doi.org/10.1109/ISTCS.1995.377047
  24. [Vio09]
    Viola, E.: On approximate majority and probabilistic time. Comput. Complex. 18(3), 337–375 (2009).  https://doi.org/10.1007/s00037-009-0267-3 MathSciNetCrossRefzbMATHGoogle Scholar
  25. [vM06]
    van Melkebeek, D.: A survey of lower bounds for satisfiability and related problems. Found. Trends Theor. Comput. Sci. 2(3), 197–303 (2006).  https://doi.org/10.1561/0400000012 MathSciNetCrossRefzbMATHGoogle Scholar
  26. [vW12]
    van Melkebeek, D., Watson, T.: Time-space efficient simulations of quantum computations. Theor. Comput. 8(1), 1–51 (2012).  https://doi.org/10.4086/toc.2012.v008a001 MathSciNetCrossRefzbMATHGoogle Scholar
  27. [Wil08]
    Williams, R.: Time-space tradeoffs for counting NP solutions modulo integers. Comput. Complex. 17(2), 179–219 (2008).  https://doi.org/10.1007/s00037-008-0248-y MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of MemphisMemphisUSA

Personalised recommendations