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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings 16th Annual IEEE Conference on Computational Complexity 2001, p.244-254
Hauptverfasser: Hastad, J., Wigderson, A.
Format: Artikel
Sprache:eng
Schlagworte:
Boolean functions
Linearity
Performance analysis
Testing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/CCC.2001.933891