Sciweavers

SIGACT
2008
71views more  SIGACT 2008»
13 years 11 months ago
PCPs with small soundness error
The soundness error of a PCP verifier is the probability (usually denoted ) that the verifier accepts an incorrect input. We are interested in the smallest possible values of for...
Irit Dinur
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
14 years 2 months ago
Derandomized Parallel Repetition of Structured PCPs
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 ...
Irit Dinur, Or Meir
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 2 days ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...