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

Probabilistically checkable proof

Known as: Transparent Proof, PCP, Probabilistically Checkable Proofs 
In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Probabilistically-Checkable Proofs (PCPs) form the algorithmic core that enables fast verification of long computations in many… Expand
Is this relevant?
2009
2009
Can a proof be checked without reading it? 
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial… Expand
Is this relevant?
2004
2004
We investigate the question of when a verifier, with the aid of a proof, can reliably compute a function faster than it can… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The purpose of this paper is to present a tentative conceptual framework for studies of vulnerability and adaptation to climate… Expand
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
jkatz s. olumbia.edu. Department of Computer S ien e, Columbia University. Work supported in part by a DoD NDSEG Fellowship. y lu… Expand
Is this relevant?
1998
1998
The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially small in the number of queries… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
We construct PCPS with strong zero-knowledge properties. First, we construct polynomially bounded (in size) PCP’S for NP which… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Efficient Probabilistically Checkable Proofs and Applications to Approximation M. BELLARE* S. GOLDWASSERt C. LUNDi A. RUSSELL$ We… Expand
  • figure 1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you… Expand
Is this relevant?