{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:39Z","timestamp":1725795879746},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_25","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"296-307","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Chailloux","sequence":"first","affiliation":[]},{"given":"Giannicola","family":"Scarpa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Khot, S.A., Kolla, A., Steurer, D., Tulsiani, M., Vishnoi, N.K.: Unique games on expanding constraint graphs are easy: extended abstract. In: Proceedings STOC 2008, pp. 21\u201328 (May 2008)","DOI":"10.1145\/1374376.1374380"},{"issue":"4","key":"25_CR2","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z. Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci.\u00a068(4), 702\u2013732 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, pcps, and nonapproximability\u2014towards tight results. SIAM J. Comput.\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM J. Comput."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Interactive information complexity. In: Proceedings of STOC 2012, pp. 505\u2013524 (May 2012)","DOI":"10.1145\/2213977.2214025"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Kerenidis, I.: Optimal bounds for quantum bit commitment. In: Proceedings of FOCS 2011, pp. 354\u2013362 (October 2011)","DOI":"10.1109\/FOCS.2011.42"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Scarpa, G.: Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost. arXiv:1310.7787 (October 2013)","DOI":"10.1007\/978-3-662-43948-7_25"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Proceedings of the FOCS 2001, pp. 270\u2013288 (October 2001)","DOI":"10.1109\/SFCS.2001.959901"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1103\/PhysRevLett.23.880","volume":"23","author":"J.F. Clauser","year":"1969","unstructured":"Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett.\u00a023, 880\u2013884 (1969)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/s00037-008-0250-4","volume":"17","author":"R. Cleve","year":"2008","unstructured":"Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect parallel repetition theorem for quantum xor proof systems. Comput. Complex.\u00a017(2), 282\u2013299 (2008)","journal-title":"Comput. Complex."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D., Vidick, T.: A parallel repetition theorem for entangled projection games, arXiv:1310.4113 (October 2013)","DOI":"10.1109\/CCC.2014.28"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: Proceedings of STOC 2007, pp. 411\u2013419 (May 2007)","DOI":"10.1145\/1250790.1250852"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Jain, R., Pereszlyi, A., Yao, P.: A parallel repetition theorem for entangled two-player one-round games under product distributions. arXiv:1311.6309 (November 2013)","DOI":"10.1109\/CCC.2014.29"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, J., Regev, O., Toner, B.: Unique games with entangled provers are easy. In: Proceedings of the FOCS 2008, pp. 457\u2013466 (October 2008)","DOI":"10.1109\/FOCS.2008.9"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, J., Vidick, T.: Parallel repetition of entangled games. In: Proceedings of STOC 2011, pp. 353\u2013362 (May 2011)","DOI":"10.1145\/1993636.1993684"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower bounds on information complexity via zero-communication protocols and applications. In: Proceedings of FOCS 2012, pp. 500\u2013509 (October 2012)","DOI":"10.1109\/FOCS.2012.68"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Parnafes, I., Raz, R., Wigderson, A.: Direct product results and the GCD problem, in old and new communication models. In: Proceedings of STOC 1997, pp. 363\u2013372 (May 1997)","DOI":"10.1145\/258533.258620"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Rao, A.: Parallel repetition in projection games and a concentration bound. In: Proceedings STOC 2008, pp. 1\u201310 (May 2008)","DOI":"10.1145\/1374376.1374378"},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM J. Comput.\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:21:47Z","timestamp":1558923707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}