Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,528,210 papers from all fields of science
Search
Sign In
Create Free Account
Probabilistically checkable proof
Known as:
Transparent Proof
, PCP
, Probabilistically Checkable Proofs
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
(SAT, ε-UNSAT)
Certificate (complexity)
Clique problem
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A matrix approach to Yang multiplication theorem
A. Munemasa
,
Pritta Etriana Putri
2017
Corpus ID: 119725774
In this paper, we use two-variable Laurent polynomials attached to matrices to encode properties of compositions of sequences…
Expand
2015
2015
Restricted probabilistically checkable proofs
Jeffrey FinkelsteinComputer
2015
Corpus ID: 47724493
In this work we provide some initial structural complexity results for classes of probabilistically checkable proof systems (PCPs…
Expand
2012
2012
An Integrated Logic for Termination and Non-Termination Reasoning
T. Le
,
Cristian Gherghina
,
Aquinas Hobor
,
W. Chin
2012
Corpus ID: 16503793
We propose a logical framework for specifying and proving assertions about program termination and non-termination. Although…
Expand
2007
2007
NO SIGNIFICANT RISK LEVEL ( NSRLS ) FOR THE PROPOSITION 65 CARCINOGENS 3 , 3 '-DIMETHYLBENZIDINE AND 3 , 3 '-DIMETHYLBENZIDINE DIHYDROCHLORIDE
2007
Corpus ID: 261068908
The cancer potencies of 3,3'-dimethylbenzidine (commonly called o-tolidine) and 3,3'dimethylbenzidine dihydrochloride were…
Expand
2007
2007
Probabilistic verification of decentralized multi-agent control strategies: a Case Study in Conflict Avoidance
L. Pallottino
,
A. Bicchi
,
Emilio Frazzoli
American Control Conference
2007
Corpus ID: 33472967
Many challenging verification problems arise from complex hybrid automata that model decentralized control systems. As an example…
Expand
Review
2003
Review
2003
How NP got a new definition: a survey of probabilistically checkable proofs
Sanjeev Arora
arXiv.org
2003
Corpus ID: 15485505
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class NP, and…
Expand
2002
2002
Probabilistically Checkable Proofs the Easy Way
Marius Zimand
IFIP TCS
2002
Corpus ID: 11629050
We present a weaker variant of the PCP Theorem that admits a significantly easier proof. In this variant the prover only has n t…
Expand
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…
Expand
1999
1999
On feedback invariance properties for systems over a principal ideal domain
J. Assan
,
J. Lafay
,
A. Perdon
IEEE Transactions on Automatic Control
1999
Corpus ID: 12637697
Simple necessary and sufficient conditions for the solvability of many control problems for linear systems over a field are based…
Expand
1996
1996
Probabilistically checkable proofs and the testing of hadamard-like codes
M. Kiwi
,
M. Sipser
1996
Corpus ID: 118363015
Recent results concerning probabilistically checkable proofs (PCPs) enable the encoding of mathematical proofs so as to allow…
Expand
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)
ACCEPT & CONTINUE