10 search results - page 1 / 2 » Combinatorial PCPs with Short Proofs |
SIAMCOMP
2008
13 years 4 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
PROPERTYTESTING
2010
13 years 2 months ago
2010
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
ECCC
2007
13 years 4 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
COCO
2010
Springer
13 years 7 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...