{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:03Z","timestamp":1725536463863},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_27","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T02:39:51Z","timestamp":1250822391000},"page":"352-365","source":"Crossref","is-referenced-by-count":13,"title":["Strong Parallel Repetition Theorem for Free Projection Games"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[]},{"given":"Ricky","family":"Rosen","sequence":"additional","affiliation":[]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Klartag, B.: Economical toric spines via cheeger\u2019s inequality (manuscript) (2008)","DOI":"10.1142\/S1793525309000096"},{"key":"27_CR2","volume-title":"STOC","author":"S. Arora","year":"2008","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: STOC. ACM, New York (2008), http:\/\/doi.acm.org\/10.1145\/1374376.1374380"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Hardt, M., Haviv, I., Rao, A., Regev, O., Steurer, D.: Rounding parallel repetitions of unique games. In: FOCS, pp. 374\u2013383 (2008)","DOI":"10.1109\/FOCS.2008.55"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Feige, U., Kindler, G., O\u2019Donnell, R.: Understanding parallel repetition requires understanding foams. In: IEEE Conference on Computational Complexity, pp. 179\u2013192 (2007)","DOI":"10.1109\/CCC.2007.39"},{"key":"27_CR5","unstructured":"Fortnow, L.J.: Complexity - theoretic aspects of interactive proof systems. Technical Report MIT-LCS\/\/MIT\/LCS\/TR-447, Department of Mathematics, Massachusetts Institute of Technology (1989)"},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00493-002-0001-0","volume":"22","author":"U. Feige","year":"2002","unstructured":"Feige, U., Verbitsky, O.: Error reduction by parallel repetition\u2014a negative result. Combinatorica\u00a022(4), 461\u2013478 (2002)","journal-title":"Combinatorica"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: STOC (2007)","DOI":"10.1145\/1250790.1250852"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Kindler, G., O\u2019Donnell, R., Rao, A., Wigderson, A.: Spherical cubes and rounding in high dimensions. In: FOCS, pp. 189\u2013198 (2008)","DOI":"10.1109\/FOCS.2008.50"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Rao, A.: Parallel repetition in projection games and a concentration bound. In: STOC (2008)","DOI":"10.1145\/1374376.1374378"},{"issue":"3","key":"27_CR10","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."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Raz, R.: A counterexample to strong parallel repetition. In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.49"},{"key":"27_CR12","unstructured":"Safra, S., Schwartz, O.: On Parallel-Repetition, Unique-Game and Max-Cut (manuscript) (2007)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T03:33:58Z","timestamp":1558496038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}