Title :
Simple analysis of graph tests for linearity and PCP
Author :
Håstad, Johan ; Wigderson, Avi
Author_Institution :
R. Inst. of Technol., Stockholm, Sweden
Abstract :
We give a simple analysis of the PCP (probabilistically Checkable Proof) with low amortized query complexity of Samorodnitsky and Trevisan (2000). The analysis also applied 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
Keywords :
computational complexity; graph theory; probability; PCP; Probabilistically Checkable Proof; acceptance probability; finite fields; graph tests; linear function; linearity testing; low amortized query complexity; Boolean functions; Linearity; Performance analysis; Testing;
Conference_Titel :
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Conference_Location :
Chicago, IL
Print_ISBN :
0-7695-1053-1
DOI :
10.1109/CCC.2001.933891
