Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DIRECT PRODUCT, TESTING, PCPS:
Reports tagged with direct product, testing, PCPs:
TR09-090 | 6th October 2009
Russell Impagliazzo, Valentine Kabanets, Avi Wigderson

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 cryptography, circuit complexity and
PCPs. Goldreich and Safra [GS00] pioneered its local testing and its PCP application. A recent
result by Dinur and ... more >>>




ISSN 1433-8092 | Imprint