3 search results - page 1 / 1 » Two Query PCP with Sub-Constant Error |
169
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
208
Voted
COCO
2010
Springer
15 years 10 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 ...
229
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...