{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:28Z","timestamp":1750694668889},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00165-4","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"277-282","source":"Crossref","is-referenced-by-count":15,"title":["Towards the parallel repetition conjecture"],"prefix":"10.1016","volume":"157","author":[{"given":"Oleg","family":"Verbitsky","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00165-4_BIB1","series-title":"Proc. Conf. on Extremal Problems for Finite Sets","first-page":"1","article-title":"Probabilistic methods in extremal finite set theory","author":"Alon","year":"1991"},{"key":"10.1016\/0304-3975(95)00165-4_BIB2","series-title":"Proc: 20th ACM Ann. Symp. on the Theory of Computing (STOC)","first-page":"113","article-title":"Multi-prover interactive proofs: how to remove intractability assumptions","author":"Ben-Or","year":"1988"},{"key":"10.1016\/0304-3975(95)00165-4_BIB3","series-title":"Proc. 6th Ann. Conf. on Structure in Complexity Theory","first-page":"110","article-title":"PSPACE is provable by two provers in one round","author":"Cai","year":"1991"},{"key":"10.1016\/0304-3975(95)00165-4_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(92)90085-T","article-title":"Playing games of incomplete information","volume":"103","author":"Cai","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00165-4_BIB5","series-title":"Proc. 6th Ann. Conf. on Structure in Complexity Theory","first-page":"116","article-title":"On the success probability of the two prover in one round proof systems","author":"Feige","year":"1991"},{"key":"10.1016\/0304-3975(95)00165-4_BIB6","series-title":"Proc. 24th ACM Ann. Symp. on the Theory of Computing (STOC)","first-page":"733","article-title":"Two-prover one-round proof systems: their power and their problems","author":"Feige","year":"1992"},{"key":"10.1016\/0304-3975(95)00165-4_BIB7","article-title":"Complexity-theoretic aspects of interactive proof systems","author":"Fortnow","year":"1989"},{"key":"10.1016\/0304-3975(95)00165-4_BIB8_1","series-title":"Proc. 3rd Ann. Conf. on Structure in Complexity Theory","first-page":"156","article-title":"On the power of multi-prover interactive protocols","author":"Fortnow","year":"1988"},{"key":"10.1016\/0304-3975(95)00165-4_BIB8_2","series-title":"Proc. 5th Ann. Conf. on Structure in Complexity Theory","first-page":"318","article-title":"Erratum","author":"Fortnow","year":"1990"},{"key":"10.1016\/0304-3975(95)00165-4_BIB9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF03041066","article-title":"A density version of the Hales-Jewett theorem","volume":"57","author":"Furstenberg","year":"1991","journal-title":"J. Anal. Math."},{"key":"10.1016\/0304-3975(95)00165-4_BIB10","series-title":"Ramsey Theory","author":"Graham","year":"1980"},{"key":"10.1016\/0304-3975(95)00165-4_BIB11","doi-asserted-by":"crossref","unstructured":"D. Lapidot and A. Shamir, A one-round, two-prover, zero-knowledge protocol for NP, in: CRYPTO'91.","DOI":"10.1007\/3-540-46766-1_16"},{"key":"10.1016\/0304-3975(95)00165-4_BIB12","series-title":"On the maximal number of ones in zero-one matrices with no forbidden rectangles","author":"Peleg","year":"1990"},{"key":"10.1016\/0304-3975(95)00165-4_BIB13","first-page":"1455","article-title":"Some developments in Ramsey theory","volume":"Vol. 2","author":"R\u00f6dl","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001654?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:52:53Z","timestamp":1555404773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001654"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00165-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}