Towards the parallel repetition conjecture

DOI10.1016/0304-3975(95)00165-4zbMath0871.68008OpenAlexW2136735959WikidataQ123121508 ScholiaQ123121508MaRDI QIDQ1351513

Oleg Verbitsky

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00165-4

zbMATH Keywords

Hales-Jewett theoremRamsey theoremerror probabilitytwo-prover one round interactive protocol

Mathematics Subject Classification ID

Cooperative games (91A12) 2-person games (91A05) Network design and communication in computer systems (68M10) Ramsey theory (05D10)

Related Items (3)

Parallel Repetition of Two-Prover One-Round Games: An Exposition ⋮ REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM ⋮ Unnamed Item

Cites Work

• On games of incomplete information
• PSPACE is provable by two provers in one round
• A density version of the Hales-Jewett theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards the parallel repetition conjecture