{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:35Z","timestamp":1725558815834},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_5","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"23-33","source":"Crossref","is-referenced-by-count":1,"title":["A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model"],"prefix":"10.1007","author":[{"given":"Ricky","family":"Rosen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 90","author":"J.-Y. Cai","year":"1990","unstructured":"Cai, J.-Y., Condon, A., Lipton, R.J.: On games of incomplete information. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415, Springer, Heidelberg (1990)"},{"issue":"15","key":"5_CR2","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(15), 880\u2013884 (1969)","journal-title":"Phys. Rev. Lett."},{"key":"5_CR3","volume-title":"Elements of information theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley-Interscience\/John Wiley & Sons, Hoboken\/ NJ (2006)","edition":"2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Feige, U.: On the success probability of the two provers in one-round proof systems. In: Structure in Complexity Theory Conference, pp. 116\u2013123 (1991)","DOI":"10.1109\/SCT.1991.160251"},{"key":"5_CR5","first-page":"172","volume-title":"Proceedings of the 26th Annual Symposium on the Theory of Computing","author":"U. Feige","year":"1994","unstructured":"Feige, U., Kilian, J.: Two prover protocols: low error at affordable rates. In: Proceedings of the 26th Annual Symposium on the Theory of Computing, pp. 172\u2013183. ACM Press, New York (May 1994)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/129712.129783","volume-title":"STOC \u201992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing","author":"U. Feige","year":"1992","unstructured":"Feige, U., Lov\u00e1sz, L.: Two-prover one-round proof systems: their power and their problems (extended abstract). In: STOC \u201992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 733\u2013744. ACM Press, New York (1992)"},{"key":"5_CR7","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":"5_CR8","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"},{"issue":"4","key":"5_CR9","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":"5_CR10","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: STOC \u201907: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007)","DOI":"10.1145\/1250790.1250852"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Popescu, S., Rohrlich, D.: Nonlocality as an axiom for quantum theory. In: Foundations of Physics, vol.\u00a024(3), pp. 379\u2013385 (1994)","DOI":"10.1007\/BF02058098"},{"key":"5_CR12","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":"5_CR13","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:36Z","timestamp":1619784996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}