# The PCP theorem by gap amplification

@article{Dinur2005ThePT,
title={The PCP theorem by gap amplification},
author={Irit Dinur},
journal={Journal of the ACM (JACM)},
year={2005},
volume={54},
pages={12 - es}
}
• Irit Dinur
• Published 1 June 2007
• Computer Science, Mathematics
• Journal of the ACM (JACM)
The PCP theorem [Arora and Safra 1998; Arora et. al. 1998] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to Feige et al. [1996], has placed the PCP theorem at the heart of the area of inapproximability. In this work, we present a new proof of the PCP theorem that draws on this equivalence. We…
196 Citations
A combination of testability and decodability by tensor products
Ben-Sasson and Sudan (RSA 2006) showed that taking the repeated tensor product of linear codes with very large distance results in codes that are locally testable. Due to the large distance
D ec 2 01 5 ETH-Hardness for Symmetric Signaling in Zero-Sum Games
We prove that, assuming the exponential time hypothesis, finding an ǫ-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time (n). This is tight
ETH-Hardness for Signaling in Symmetric Zero-Sum Games
It is proved that, assuming the exponential time hypothesis, finding an \epsilon-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time and that finding a multiplicative approximation is NP-hard.
On Dinur’s proof of the PCP theorem
• Mathematics
• 2006
Probabilistically checkable proofs are proofs that can checked probabilistically by reading very few bits of the proof. In the early 1990’s, it was shown that proofs could be transformed into
Ju l 2 01 9 Imperfect Gaps in Gap-ETH and PCPs
• 2019
We study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness,
Privacy and the Complexity of Simple Queries
A sharp upper bound on the number of linear queries that can be accurately answered while satisfying differential privacy by an efficient algorithm is shown, assuming the existence of cryptographic traitor-tracing schemes.
Restricted probabilistically checkable proofs
In this work we provide some initial structural complexity results for classes of probabilistically checkable proof systems (PCPs) for nondeterministic NC (NNC) circuit families, as a first step
Positive and Negative Results in Approximation and Parameterized Complexity
Several real-Life problems are NP-Hard and cannot be solved in polynomial time.The two main options to overcome this issue are: approximation and parameterized complexity. In this thesis, we present
Privacy and the Complexity of Simple Queries
A sharp upper bound on the number of linear queries that can be accurately answered while satisfying differential privacy by an efficient algorithm is shown, assuming the existence of cryptographic traitor-tracing schemes.
The PCP Theorem and Hardness of Approximation
In this report, we give a brief overview of Probabilistically Chekable proofs, and present Irit Dinur’s proof of the celebrated PCP theorem. We also briefly deal with the importance of the PCP

## References

SHOWING 1-10 OF 35 REFERENCES
Expander Graphs and their Applications
• Mathematics
• 2006
A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in
Gap Amplification in PCPs Using Lazy Random Walks
This work constructs a product Gt of a constraint graph G, so that if every assignment in G leaves an e-fraction of the edges unsatisfied, then in Gt every assignment amplifies the gap by a factor Ω(t), and ensures that some random variables arising in the proof are automatically independent, and avoid some technical difficulties.
Non-deterministic exponential time has two-prover interactive protocols
• Computer Science
computational complexity
• 2005
It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.
Undirected ST-connectivity in log-space
A deterministic, log-space algorithm that solves st-connectivity in undirected graphs and implies a way to construct in log- space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph.
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
• Computer Science, Mathematics
FOCS
• 2004
The notion of an assignment tester is introduced, which is a strengthening of the standard PCP verifier, in the following sense, which enables composition that is truly modular, i.e., one can compose two assignment-testers without any assumptions on how they are constructed.
Robust Locally Testable Codes and Products of Codes
• Computer Science, Mathematics
APPROX-RANDOM
• 2004
The notion of robust local testability of codes is introduced, and codes built by tensor products can be tested robustly and somewhat locally, by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low-degree multivariate polynomials.
Robust pcps of proximity, shorter pcps and applications to coding
• Mathematics, Computer Science
STOC '04
• 2004
The techniques include the introduction of a new variant of PCPs that are called "Robust PCPs", which facilitate proof composition, which is a central ingredient in construction of PCP systems.
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
• Mathematics, Computer Science
STOC '03
• 2003
We present the first explicit construction of Probabilistically Checkable Proofs (PCPs) and Locally Testable Codes (LTCs) of fixed constant query complexity which have almost-linear (= n * 2Õ(√log