A parallel repetition theorem

Explore this paper's citation graph

Summary

It is shown that a parallel repetition of any two-prover one-round proof system (MIP(2,1) decreases the probability of error at an exponential rate, and no constructive bound was previously known.

Type
article
Published
1995-05-29
Cited by
875
References
45
Access
Open access

Keywords

Citation, Repetition (rhetorical device), Computer science, World Wide Web, Philosophy

References

Cited by

Related papers