Towards the parallel repetition conjecture

Theoretical Computer Science

Volumn 157, Issue 2, 1996, Pages 277-282

  Verbitsky, Oleg ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GAME THEORY; PROBABILITY; RANDOM PROCESSES; SET THEORY; VECTORS;

ERROR PROBABILITY; FREE GAME; HALES JEWETT THEOREM; PARALLEL REPETITION CONJECTURE; RAMSEY THEORY; TWO POWER ONE ROUND INTERACTIVE PROTOCOL;

COMPUTATION THEORY;

EID: 0030570117     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00165-4     Document Type: Article

References (13)

1. N. Alon, Probabilistic methods in extremal finite set theory, in: G.O.H. Katona et al., eds., Proc. Conf. on Extremal Problems for Finite Sets, Visegrad, Hungary (1991) 1-13, to appear.
2. M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson, Multi-prover interactive proofs: how to remove intractability assumptions, in: Proc. 20th ACM Ann. Symp. on the Theory of Computing (STOC) (1988) 113-131.
3. J. Cai, A. Condon and R.J. Lipton, PSPACE is provable by two provers in one round, in: Proc. 6th Ann. Conf. on Structure in Complexity Theory (1991) 110-115.
4. J. Cai, A. Condon and R.J. Lipton, Playing games of incomplete information, Theoret. Comput. Sci. 103 (1992) 25-38.
5. U. Feige, On the success probability of the two prover in one round proof systems, in: Proc. 6th Ann. Conf. on Structure in Complexity Theory (1991) 116-123.
6. U. Feige and L. Lovász, Two-prover one-round proof systems: their power and their problems, in: Proc. 24th ACM Ann. Symp. on the Theory of Computing (STOC) (1992) 733-744.
7. L. Fortnow, Complexity-theoretic aspects of interactive proof systems, Ph.D. Thesis, Tech. Report #MIT/LCS/TR-447, Massachusetts Institute of Technology, 1989.
8. L. Fortnow, J. Rompel and M. Sipser, On the power of multi-prover interactive protocols, in: Proc. 3rd Ann. Conf. on Structure in Complexity Theory (1988) 156-161. Erratum in: Proc. 5th Ann. Conf. on Structure in Complexity Theory (1990) 318-319.
9. H. Furstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem, J. Anal. Math. 57 (1991) 64-119.
10. R.L. Graham, B.L. Rothschild and J.H. Spenser, Ramsey Theory (Wiley. New York, 1980).
11. D. Lapidot and A. Shamir, A one-round, two-prover, zero-knowledge protocol for NP. in: CRYPTO'91.
12. D. Peleg, On the maximal number of ones in zero-one matrices with no forbidden rectangles, manuscript, 1990.
13. V. Rödl, Some developments in Ramsey theory, in: Proc. Internat. Congress of Mathematicians, Vol. 2, Kyoto, Japan (1990) 1455-1466.