{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:41:54Z","timestamp":1753886514657,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374378","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Parallel repetition in projection games and a concentration bound"],"prefix":"10.1145","author":[{"given":"Anup","family":"Rao","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250818"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.66.042111"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_7_1","volume-title":"Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference","author":"Ben-Or M.","year":"1989","unstructured":"M. Ben-Or , S. Goldwasser , J. Kilian , and A. Wigderson . Efficient identification schemes using two prover interactive proofs . In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference , Proceedings , 1989 . M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1989."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132547"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.36"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.23.880"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132567"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.66.042111"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_16_1","volume-title":"Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference","author":"Ben-Or M.","year":"1989","unstructured":"M. Ben-Or , S. Goldwasser , J. Kilian , and A. Wigderson . Efficient identification schemes using two prover interactive proofs . In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference , Proceedings , 1989 . M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1989."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132547"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.36"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.23.880"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132567"},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference","author":"Dwork C.","year":"1992","unstructured":"C. Dwork , U. Feige , J. Kilian , M. Naor , and S. Safra . Low communication 2-prover zero-knowledge proofs for NP . In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference , Proceedings , 1992 . C. Dwork, U. Feige, J. Kilian, M. Naor, and S. Safra. Low communication 2-prover zero-knowledge proofs for NP. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1992."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-002-0001-0"},{"key":"e_1_3_2_1_26_1","first-page":"42","article-title":"Accardi contra bell (cum mundi): The impossible coupling","author":"Gill R. D.","year":"2003","unstructured":"R. D. Gill . Accardi contra bell (cum mundi): The impossible coupling . IMS LECTURE NOTES-MONOGRAPH SERIES , 42 , 2003 . R. D. Gill. Accardi contra bell (cum mundi): The impossible coupling. IMS LECTURE NOTES-MONOGRAPH SERIES, 42, 2003.","journal-title":"IMS LECTURE NOTES-MONOGRAPH SERIES"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109569"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250852"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.49"},{"key":"e_1_3_2_1_32_1","first-page":"379","volume-title":"IEEE Conference on Computational Complexity","author":"Khot S.","unstructured":"S. Khot and O. Regev . Vertex cover might be hard to approximate to within 2-\u00eb . In IEEE Conference on Computational Complexity , page 379 . IEEE Computer Society, 2003. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-\u00eb. In IEEE Conference on Computational Complexity, page 379. IEEE Computer Society, 2003."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.74"},{"key":"e_1_3_2_1_34_1","first-page":"15","article-title":"A one-round, two-prover, zero-knowledge protocol for NP","author":"Lapidot D.","year":"1995","unstructured":"D. Lapidot and A. Shamir . A one-round, two-prover, zero-knowledge protocol for NP . Combinatorica , 15 , 1995 . D. Lapidot and A. Shamir. A one-round, two-prover, zero-knowledge protocol for NP. Combinatorica, 15, 1995.","journal-title":"Combinatorica"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167172"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.53"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258620"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.22"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1994.315794"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":40,"alternative-id":["10.1145\/1374376.1374378","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374378","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}