Simple analysis of graph tests for linearity and PCP

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 li...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Random structures & algorithms 2003-03, Vol.22 (2), p.139-160
Hauptverfasser: Håstad, Johan, Wigderson, Avi
Format: Artikel
Sprache:eng
Schlagworte:
graph test
hardness
iterated test
linearity testing
PCP
proofs
pseudorandomness
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 139–160, 2003
ISSN:1042-9832
1098-2418
1098-2418
DOI:10.1002/rsa.10068