3 search results - page 1 / 1 » Derandomized Parallel Repetition of Structured PCPs |
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 ...
ECCC
2010
13 years 4 months ago
2010
STOC
2009
ACM
14 years 5 months ago
2009
ACM
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...