{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:44:27Z","timestamp":1743068667010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_62","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"864-872","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quadratic Simulations of Merlin\u2013Arthur Games"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Watson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"62_CR1","doi-asserted-by":"publisher","unstructured":"Allender, E., Kouck\u00fd, 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\u2013302. IEEE (2001). https:\/\/doi.org\/10.1109\/CCC.2001.933896","DOI":"10.1109\/CCC.2001.933896"},{"issue":"1","key":"62_CR2","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1490270.1490272","volume":"1","author":"S Aaronson","year":"2009","unstructured":"Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theor. 1(1), 2:1\u20132:54 (2009). https:\/\/doi.org\/10.1145\/1490270.1490272","journal-title":"ACM Trans. Comput. Theor."},{"key":"62_CR3","doi-asserted-by":"publisher","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th Symposium on Theory of Computing (STOC), pp. 421\u2013429. ACM (1985). https:\/\/doi.org\/10.1145\/22145.22192","DOI":"10.1145\/22145.22192"},{"issue":"2","key":"62_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcss.1995.1017","volume":"50","author":"R Beigel","year":"1995","unstructured":"Beigel, R., Reingold, N., Spielman, D.: PP is closed under intersection. J. Comput. Syst. Sci. 50(2), 191\u2013202 (1995). https:\/\/doi.org\/10.1006\/jcss.1995.1017","journal-title":"J. Comput. Syst. Sci."},{"key":"62_CR5","unstructured":"Carothers, N.: A short course on approximation theory. Lecture notes. http:\/\/personal.bgsu.edu\/~carother\/Approx.html"},{"key":"62_CR6","doi-asserted-by":"publisher","unstructured":"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\u201319. IEEE (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63449","DOI":"10.1109\/SFCS.1989.63449"},{"key":"62_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-74208-1_33","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S Diehl","year":"2007","unstructured":"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\u2013463. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_33"},{"issue":"3","key":"62_CR8","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/050642228","volume":"36","author":"S Diehl","year":"2006","unstructured":"Diehl, S., van Melkebeek, D.: Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM J. Comput. 36(3), 563\u2013594 (2006). https:\/\/doi.org\/10.1137\/050642228","journal-title":"SIAM J. Comput."},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01111276","volume":"86","author":"H Ehlich","year":"1964","unstructured":"Ehlich, H., Zeller, K.: Schwankung von polynomen zwischen gitterpunkten. Mathematische Zeitschrift 86, 41\u201344 (1964)","journal-title":"Mathematische Zeitschrift"},{"issue":"2","key":"62_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0890-5401(03)00018-X","volume":"182","author":"S Fenner","year":"2003","unstructured":"Fenner, S., Fortnow, L., Kurtz, S., Li, L.: An oracle builder\u2019s toolkit. Inf. Comput. 182(2), 95\u2013136 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00018-X","journal-title":"Inf. Comput."},{"issue":"2","key":"62_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1006\/jcss.1999.1651","volume":"59","author":"L Fortnow","year":"1999","unstructured":"Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. J. Comput. Syst. Sci. 59(2), 240\u2013252 (1999). https:\/\/doi.org\/10.1006\/jcss.1999.1651","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"62_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"O Gabber","year":"1981","unstructured":"Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22(3), 407\u2013420 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90040-4","journal-title":"J. Comput. Syst. Sci."},{"key":"62_CR13","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pp. 248\u2013253. IEEE (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63486","DOI":"10.1109\/SFCS.1989.63486"},{"key":"62_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"62_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(83)90044-3","volume":"17","author":"C Lautemann","year":"1983","unstructured":"Lautemann, C.: BPP and the polynomial hierarchy. Inf. Process. Lett. 17(4), 215\u2013217 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90044-3","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"62_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/0703024","volume":"3","author":"T Rivlin","year":"1966","unstructured":"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\u2013320 (1966)","journal-title":"SIAM J. Numer. Anal."},{"key":"62_CR17","volume-title":"An Introduction to the Approximation of Functions","author":"T Rivlin","year":"1981","unstructured":"Rivlin, T.: An Introduction to the Approximation of Functions. Dover, New York City (1981)"},{"issue":"2","key":"62_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s000370050007","volume":"7","author":"A Russell","year":"1998","unstructured":"Russell, A., Sundaram, R.: Symmetric alternation captures BPP. Comput. Complex. 7(2), 152\u2013162 (1998). https:\/\/doi.org\/10.1007\/s000370050007","journal-title":"Comput. Complex."},{"issue":"2","key":"62_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jcss.1999.1654","volume":"59","author":"R Raz","year":"1999","unstructured":"Raz, R., Tardos, G., Verbitsky, O., Vereshchagin, N.: Arthur-Merlin games in Boolean decision trees. J. Comput. Syst. Sci. 59(2), 346\u2013372 (1999). https:\/\/doi.org\/10.1006\/jcss.1999.1654","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"62_CR20","doi-asserted-by":"publisher","first-page":"2329","DOI":"10.1137\/100785260","volume":"42","author":"A Sherstov","year":"2013","unstructured":"Sherstov, A.: The intersection of two halfspaces has high threshold degree. SIAM J. Comput. 42(6), 2329\u20132374 (2013). https:\/\/doi.org\/10.1137\/100785260","journal-title":"SIAM J. Comput."},{"key":"62_CR21","doi-asserted-by":"publisher","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the 15th Symposium on Theory of Computing (STOC), pp. 330\u2013335. ACM (1983). https:\/\/doi.org\/10.1145\/800061.808762","DOI":"10.1145\/800061.808762"},{"key":"62_CR22","doi-asserted-by":"publisher","unstructured":"Vereshchagin, N.: On the power of PP. In: Proceedings of the 7th Structure in Complexity Theory Conference (STRUCTURES), pp. 138\u2013143. IEEE (1992). https:\/\/doi.org\/10.1109\/SCT.1992.215389","DOI":"10.1109\/SCT.1992.215389"},{"key":"62_CR23","doi-asserted-by":"publisher","unstructured":"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\u201351. IEEE (1995). https:\/\/doi.org\/10.1109\/ISTCS.1995.377047","DOI":"10.1109\/ISTCS.1995.377047"},{"issue":"3","key":"62_CR24","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00037-009-0267-3","volume":"18","author":"E Viola","year":"2009","unstructured":"Viola, E.: On approximate majority and probabilistic time. Comput. Complex. 18(3), 337\u2013375 (2009). https:\/\/doi.org\/10.1007\/s00037-009-0267-3","journal-title":"Comput. Complex."},{"issue":"3","key":"62_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1561\/0400000012","volume":"2","author":"D van Melkebeek","year":"2006","unstructured":"van Melkebeek, D.: A survey of lower bounds for satisfiability and related problems. Found. Trends Theor. Comput. Sci. 2(3), 197\u2013303 (2006). https:\/\/doi.org\/10.1561\/0400000012","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"1","key":"62_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2012.v008a001","volume":"8","author":"D van Melkebeek","year":"2012","unstructured":"van Melkebeek, D., Watson, T.: Time-space efficient simulations of quantum computations. Theor. Comput. 8(1), 1\u201351 (2012). https:\/\/doi.org\/10.4086\/toc.2012.v008a001","journal-title":"Theor. Comput."},{"issue":"2","key":"62_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00037-008-0248-y","volume":"17","author":"R Williams","year":"2008","unstructured":"Williams, R.: Time-space tradeoffs for counting NP solutions modulo integers. Comput. Complex. 17(2), 179\u2013219 (2008). https:\/\/doi.org\/10.1007\/s00037-008-0248-y","journal-title":"Comput. Complex."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:11:10Z","timestamp":1709824270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}