Sciweavers

Share
COCO
2001
Springer

Simple Analysis of Graph Tests for Linearity and PCP

10 years 2 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite fields, giving a better estimate of the acceptance probability in terms of the distance of the tested function to the closest linear function.
Johan Håstad, Avi Wigderson
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where COCO
Authors Johan Håstad, Avi Wigderson
Comments (0)
books