Sciweavers

STOC
1995
ACM
108views Algorithms» more  STOC 1995»
14 years 3 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz