Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
(SAT, ε-UNSAT)Certificate (complexity)Clique problemComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
An extended footnote on finitely minimal martingale measures
This note contains a short discussion on the sufficiency of finite optimality in martingale transport. It is shown that finitely… 
2015
2015
Restricted probabilistically checkable proofs
In this work we provide some initial structural complexity results for classes of probabilistically checkable proof systems (PCPs… 
2008
2008
Rational Subsets in HNN-Extensions and Amalgamated Products
Several transfer results for rational subsets and finitely generated subgroups of HNN-extensions G = 〈 H,t; t-1 at = φ(a) (a ∈ A… 
2008
2008
A Combinatorial Study of k-Valued Rational Relations
We give combinatorial proofs for three fundamental properties of k-valued rational relations: the decomposition of a k-valued… 
Review
2003
Review
2003
How NP got a new definition: a survey of probabilistically checkable proofs
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class NP, and… 
2002
2002
Probabilistically Checkable Proofs the Easy Way
We present a weaker variant of the PCP Theorem that admits a significantly easier proof. In this variant the prover only has n t… 
1999
1999
On feedback invariance properties for systems over a principal ideal domain
Simple necessary and sufficient conditions for the solvability of many control problems for linear systems over a field are based… 
1999
1999
Decision procedures for the analysis of cryptographic protocols by logics of belief
  • D. Monniaux
  • Proceedings of the 12th IEEE Computer Security…
  • 1999
  • Corpus ID: 11283134
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In… 
1996
1996
Probabilistically checkable proofs and the testing of hadamard-like codes
Recent results concerning probabilistically checkable proofs (PCPs) enable the encoding of mathematical proofs so as to allow… 
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)