{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215887,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090259","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"266-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum interactive proofs with weak error bounds"],"prefix":"10.1145","author":[{"given":"Tsuyoshi","family":"Ito","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Ontario, Canada"}]},{"given":"Hirotada","family":"Kobayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"John","family":"Watrous","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293639"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Basu S. Pollack R. and \n      \n      \n      Roy M\n      \n  \n  .\n  -F. Algorithms in Real Algebraic Geometry vol. \n  10\n   of \n  Algorithms and Computation in Mathematics\n  . \n  Springer 2003\n  .   Basu S. Pollack R. and Roy M.-F. Algorithms in Real Algebraic Geometry vol. 10 of Algorithms and Computation in Mathematics . Springer 2003.","DOI":"10.1007\/978-3-662-05355-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62257"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009378.1009560"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205040"},{"volume-title":"Theory of Computational Complexity. Series in Discrete Mathematics and Optimization. Wiley-Interscience","year":"2000","author":"Du D.-Z.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80056-X"},{"volume-title":"Manuscript","year":"1986","author":"Feldman P.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M. Lov\u00e1sz L. and \n      \n      \n      Schrijver A\n      \n  \n  . \n  Geometric Algorithms and Combinatorial Optimization vol. \n  2\n   of \n  Algorithms and Combinatorics\n  . \n  Springer 1988\n  .  Gr\u00f6tschel M. Lov\u00e1sz L. and Schrijver A. Geometric Algorithms and Combinatorial Optimization vol. 2 of Algorithms and Combinatorics . Springer 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250873"},{"key":"e_1_3_2_1_14_1","unstructured":"Gutoski G. and Wu X. Parallel approximation of min-max problems with applications to classical and quantum zero-sum games Apr. 2011. Available as arXiv.org e-Print 1011.2787v2 {quant-ph}.  Gutoski G. and Wu X. Parallel approximation of min-max problems with applications to classical and quantum zero-sum games Apr. 2011. Available as arXiv.org e-Print 1011.2787v2 {quant-ph}."},{"key":"e_1_3_2_1_15_1","first-page":"141","volume":"8","author":"Holenstein T.","year":"2009","journal-title":"Article"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-642-14165-2_13","volume-title":"Automata, Languages and Programming: Thirty-Seventh International Colloquium, Part I (July","author":"Ito T.","year":"2010"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.22"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806768"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0275-3"},{"key":"e_1_3_2_1_21_1","first-page":"1","volume":"20","author":"Khachiyan L. G.","year":"1979","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335387"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","first-page":"277","volume-title":"Graph-Theoretic Concepts in Computer Science (June","author":"Lozano A.","year":"1989"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322037"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0194-x"},{"volume-title":"Electronic Colloquium on Computational Complexity","year":"2010","author":"Meir O.","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Nesterov Y. and \n      \n      \n      Nemirovskii A\n      \n  \n  . \n  Interior-Point Polynomial Algorithms in Convex Programming vol. \n  13\n   of \n  SIAM Studies in Applied Mathematics\n  . \n  SIAM 1994\n  .  Nesterov Y. and Nemirovskii A. Interior-Point Polynomial Algorithms in Convex Programming vol. 13 of SIAM Studies in Applied Mathematics . SIAM 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896874"},{"key":"e_1_3_2_1_30_1","unstructured":"Preda D. Private communication.  Preda D. Private communication."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/254473.254508"},{"key":"e_1_3_2_1_32_1","unstructured":"Roman S.\n      \n  \n   \n  Field Theory vol. \n  158\n   of \n  Graduate Texts in Mathematics\n  . \n  Springer 2006\n  .  Roman S. Field Theory vol. 158 of Graduate Texts in Mathematics . Springer 2006."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146613"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000511"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_38"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_12"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796385"},{"key":"e_1_3_2_1_39_1","unstructured":"Wu X. Equilibrium value method for the proof of QIP = PSPACE. Available as arXiv.org e-Print 1004.0264v4 {quant-ph} Mar. 2011.  Wu X. Equilibrium value method for the proof of QIP = PSPACE. Available as arXiv.org e-Print 1004.0264v4 {quant-ph} Mar. 2011."}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts","acronym":"ITCS '12"},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090259","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":39,"alternative-id":["10.1145\/2090236.2090259","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090259","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}