Sciweavers

2 search results - page 1 / 1
» Locally decodable codes with 2 queries and polynomial identi...
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 5 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 5 months 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...