{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:35:41Z","timestamp":1764131741710,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520071","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"998-1009","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel repetition for all 3-player games over binary alphabet"],"prefix":"10.1145","author":[{"given":"Uma","family":"Girish","sequence":"first","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Justin","family":"Holmgren","sequence":"additional","affiliation":[{"name":"NTT Research, USA"}]},{"given":"Kunal","family":"Mittal","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Wei","family":"Zhan","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793525309000096"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811969"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_27"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746565"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.85"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313847"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2017.37"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160251"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.78"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.39"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-002-0001-0"},{"key":"e_1_3_2_1_18_1","unstructured":"Lance Fortnow. 1989. Complexity theoretic aspects of interactive proof systems. Ph. D. Dissertation. MIT.  Lance Fortnow. 1989. Complexity theoretic aspects of interactive proof systems. Ph. D. Dissertation. MIT."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90251-8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03041066"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2021.62"},{"key":"e_1_3_2_1_22_1","volume-title":"Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR, abs\/2202.06826","author":"Girish Uma","year":"2022","unstructured":"Uma Girish , Justin Holmgren , Kunal Mittal , Ran Raz , and Wei Zhan . 2022. Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR, abs\/2202.06826 ( 2022 ), arxiv:2202.06826 Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan. 2022. Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR, abs\/2202.06826 (2022), arxiv:2202.06826"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Uma Girish Kunal Mittal Ran Raz and Wei Zhan. 2022. Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. https:\/\/eccc.weizmann.ac.il\/report\/2022\/043\/  Uma Girish Kunal Mittal Ran Raz and Wei Zhan. 2022. Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. https:\/\/eccc.weizmann.ac.il\/report\/2022\/043\/","DOI":"10.1145\/3519935.3520071"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0849-4_10"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_26_1","volume-title":"Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR, abs\/1604.05757","author":"Hazla Jan","year":"2016","unstructured":"Jan Hazla , Thomas Holenstein , and Anup Rao . 2016. Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR, abs\/1604.05757 ( 2016 ), arxiv:1604.05757 Jan Hazla, Thomas Holenstein, and Anup Rao. 2016. Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR, abs\/1604.05757 (2016), arxiv:1604.05757"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_3_2_1_28_1","volume-title":"A Parallel Repetition Theorem for the GHZ Game. CoRR, abs\/2008.05059","author":"Holmgren Justin","year":"2020","unstructured":"Justin Holmgren and Ran Raz . 2020. A Parallel Repetition Theorem for the GHZ Game. CoRR, abs\/2008.05059 ( 2020 ), arxiv:2008.05059 Justin Holmgren and Ran Raz. 2020. A Parallel Repetition Theorem for the GHZ Game. CoRR, abs\/2008.05059 (2020), arxiv:2008.05059"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316367"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.50"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.71"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258620"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.175.3.6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374378"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/090747270"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.11"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00165-4"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520071","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:16Z","timestamp":1750188676000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":40,"alternative-id":["10.1145\/3519935.3520071","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520071","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}