Simple analysis of graph tests for linearity and PCP

Johan Håstad; Avi Wigderson

doi:10.1109/CCC.2001.933891

Simple analysis of graph tests for linearity and PCP

Johan Håstad, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

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

9 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	244-254
Number of pages	11
Journal	Proceedings of the Annual IEEE Conference on Computational Complexity
DOIs	https://doi.org/10.1109/CCC.2001.933891
State	Published - 2001

Keywords

Graph test
Iterated test
Linearity testing
PCP
Pseudorandomness

Access to Document

10.1109/CCC.2001.933891

Cite this

@article{22f8295d8dfb44878fb56185c6631294,

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 [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.",

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

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

year = "2001",

doi = "10.1109/CCC.2001.933891",

language = "אנגלית",

pages = "244--254",

journal = "Proceedings of the Annual IEEE Conference on Computational Complexity",

issn = "1093-0159",

publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Simple analysis of graph tests for linearity and PCP

AU - Håstad, Johan

AU - Wigderson, Avi

PY - 2001

Y1 - 2001

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

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

KW - Graph test

KW - Iterated test

KW - Linearity testing

KW - PCP

KW - Pseudorandomness

UR - http://www.scopus.com/inward/record.url?scp=0034858395&partnerID=8YFLogxK

U2 - 10.1109/CCC.2001.933891

DO - 10.1109/CCC.2001.933891

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

AN - SCOPUS:0034858395

SN - 1093-0159

SP - 244

EP - 254

JO - Proceedings of the Annual IEEE Conference on Computational Complexity

JF - Proceedings of the Annual IEEE Conference on Computational Complexity

ER -

Simple analysis of graph tests for linearity and PCP

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this