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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Probabilistically Checkable Proofs (PCPs) [Babai et al. FOCS 90; Arora et al. JACM 98] can be used to construct asymptotically… (More)
  • table 1
  • figure 1.1
  • table 2
  • table 3
  • table 4
Is this relevant?
2015
2015
  • Jeffrey FinkelsteinComputer
  • 2015
In this work we provide some initial structural complexity results for classes of probabilistically checkable proof systems (PCPs… (More)
Is this relevant?
2014
2014
A probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to… (More)
Is this relevant?
2013
2013
Probabilistically-Checkable Proofs (PCPs) form the algorithmic core that enables fast verification of long computations in many… (More)
Is this relevant?
2012
2012
Probabilistically-Checkable Proofs (PCPs) form the algorithmic core that enables succinct verification of long proofs… (More)
  • table 1
Is this relevant?
2007
2007
We show a construction of a PCP with both sub-constant error and almost-linear size. Specifically, for some constant 0 < α < 1… (More)
Is this relevant?
2005
2005
In this paper, we describe a proof-of-concept implementation of the probabilistically checkable proof of proximity (PCPP) system… (More)
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… (More)
  • figure 1
  • figure 2
Is this relevant?
1995
1995
We introduce a new model of fault tolerance for Boolean circuits. We consider synchronized circuits and we allow an adversary to… (More)
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… (More)
  • figure 1
Is this relevant?