Ran Raz

Suggest Changes
Learn More
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 previously known. The(More)
  • Ran Raz
  • Electronic Colloquium on Computational Complexity
  • 2004
We show how to extract random bits from two or more independent weak random sources in cases where only one source is of linear min-entropy and all other sources are of logarithmic min-entropy. Our(More)