Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

PCP theorem

Known as: PCP, 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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The Paris chondrite provides an excellent opportunity to study CM chondrules and refractory inclusions in a more pristine state… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We show that the NP-Complete language 3Sat has a PCPverifier that makes two queries to a proof of almost-linear size and achieves… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The PCP theorem [Arora and Safra 1998; Arora et. al. 1998] says that every language in NP has a witness format that can be… Expand
Is this relevant?
2007
2007
The PCP theorem [Arora and Safra 1998; Arora et. al. 1998] says that every language in NP has a witness format that can be… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a new proof of the PCP theorem that is based on a combinatorial amplification lemma. The unsat value of a set of… Expand
Is this relevant?
2006
2006
Probabilistically checkable proofs are proofs that can checked probabilistically by reading very few bits of the proof. In the… Expand
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… Expand
Is this relevant?
2000
2000
Strategies to enhance biotransformation of pentachlorophenol (PCP) in a spectrum of wetland soils were investigated under… Expand
  • table 1
  • figure 2
  • figure 1
  • table 3
  • table 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of… Expand
Is this relevant?