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
- OpenAlex
- https://openalex.org/W2007997869
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14808758
Keywords
Citation, Repetition (rhetorical device), Computer science, World Wide Web, Philosophy
References
- The Parallel Repetition Conjecture for Trees is True
- Hardness of approximations
- The probabilistic communication complexity of set intersection
- Entropy and Information Theory
- Error reduction by parallel repetition-the state of the art
- Two-prover one-round proof systems: their power and their problems (extended abstract)
- Towards the parallel repetition conjecture
- Complexity-Theoretic Aspects of Interactive Proof Systems
- On bounded round multiprover interactive proof systems
- Error Reduction by Parallel Repetition—A Negative Result
- The Probabilistic Communication Complexity of Set Intersection
- Testing of the long code and hardness for clique
- Improved non-approximability results
- Direct product results and the GCD problem, in old and new communication models
- On the Power of Multi-Prover Interactive Protocols
- The complexity of approximating a nonlinear program
- A one-round, two-prover, zero-knowledge protocol for NP
- On the maximum density of 0-1 matrices with no forbidden rectangles
- On the hardness of approximating minimization problems
- On the Distributional Complexity of Disjointness
Cited by
- Almost Optimal Bounds for Direct Product Threshold Theorem
- Efficient Communication Using Partial Information
- A lower bound for approximating the grundy number
- Approximation for Dominating Set Problem with Measure Functions
- On Vulnerability of Banking Networks
- The Approximability of Learning and Constraint Satisfaction Problems
- Improved approximation algorithms for Directed Steiner Forest
- Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
- Local Constraints in Combinatorial Optimization
- The Hilbertian Tensor Norm and its Connection to Quantum Information Theory
- P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma
- Approximation Algorithms for Network Design and Orienteering
- Minimizing DNF Formulas and AC0 Circuits Given a Truth Table
- Quantum Two Provers Interactive Proof Systems
- A Simple Biased Distribution for Dinur's Construction
- Approximating np-hard problems efficient algorithms and their limits
- Graph Partitioning and Semi-definite Programming Hierarchies
- Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist
- Hardness amplification proofs require majority
- Towards optimal lower bounds for clique and chromatic number
Related papers
- Repetitions of a text: A text on repetition
- Recall it again, Sam. Practices of Repetition in the Security Council
- A Study of the Repetitive Narration in Novels
- Stylistic Use of Repetition in English Literature
- The Repetition Phenomena in the Dialogue
- The Effect of Repetition on the Academic Performance of Primary School Repeaters
- And Finally . . . Repetition, Repetition, Repetition