Simple Analysis of Graph Tests for Linearity and PCP

Johan Håstad; Avi Wigderson

doi:10.1002/rsa.10068

Simple Analysis of Graph Tests for Linearity and PCP

Johan Håstad^*
, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

72 Scopus citations

Abstract

We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan. 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.

Original language	English
Pages (from-to)	139-160
Number of pages	22
Journal	Random Structures and Algorithms
Volume	22
Issue number	2
DOIs	https://doi.org/10.1002/rsa.10068
State	Published - Mar 2003

Keywords

Graph test
Iterated test
Linearity testing
PCP
Pseudorandomness

Access to Document

10.1002/rsa.10068

Cite this

@article{23448bfce1534af48451ba551a072e15,

title = "Simple Analysis of Graph Tests for Linearity and PCP",

abstract = "We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan. 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.",

keywords = "Graph test, Iterated test, Linearity testing, PCP, Pseudorandomness",

author = "Johan H{\aa}stad and Avi Wigderson",

year = "2003",

month = mar,

doi = "10.1002/rsa.10068",

language = "אנגלית",

volume = "22",

pages = "139--160",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - Simple Analysis of Graph Tests for Linearity and PCP

AU - Håstad, Johan

AU - Wigderson, Avi

PY - 2003/3

Y1 - 2003/3

N2 - We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan. 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.

AB - We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan. 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.

KW - Graph test

KW - Iterated test

KW - Linearity testing

KW - PCP

KW - Pseudorandomness

UR - https://www.scopus.com/pages/publications/0242299157

U2 - 10.1002/rsa.10068

DO - 10.1002/rsa.10068

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0242299157

SN - 1042-9832

VL - 22

SP - 139

EP - 160

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

Simple Analysis of Graph Tests for Linearity and PCP

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this