PCP theorem

Known as: PCP characterization theorem 
In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2018
05101519952018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this note, we prove the following theorem, which is a major step toward a proof of the PCP theorem. Recall that in the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We show that the NP-Complete language 3Sat has a PCP verifier that makes two queries to a proof of almost-linear size and… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
Probabilistically checkable proofs are proofs that can be checked probabilistically by reading very few bits of the proof. In the… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new proof of the PCP theorem that is based on a combinatorial amplification lemma. The <i>unsat value</i> of a set… (More)
Is this relevant?
2005
2005
Our main result is that the membership x∈SAT (for x of length n) can be proved by a logarithmic-size quantum state |Ψ〉, together… (More)
Is this relevant?
2005
2005
The PCP Theorem is concerned with the notion of “proofs” for mathematical statements. We begin with a somewhat informal… (More)
  • figure 1
  • figure 2
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this work, we look back into the proof of the PCP theorem, with the goal of finding new proofs that are "more combinatorial… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
Probabilistically Checkable Proofs (PCPs) provide a format of rewriting and verifyingmathematical proofs that allow efficient… (More)
  • figure 1-1
  • figure 1-2
  • figure 2-1
  • figure 2-2
  • figure 7-3
Is this relevant?
1997
1997
jeev Arora, from Princeton, was the guest speaker. The participants thus had a unique occasion to hear about what is arguably the… (More)
Is this relevant?
1997
1997
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically… (More)
Is this relevant?