Sciweavers

3 search results - page 1 / 1
» A 3-query PCP over integers
Sort
View
STOC
2007
ACM
123views Algorithms» more  STOC 2007»
14 years 5 months ago
A 3-query PCP over integers
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...
Venkatesan Guruswami, Prasad Raghavendra
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...
STACS
2010
Springer
13 years 12 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
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...
Victor Chen, Elena Grigorescu, Ronald de Wolf