Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

COCO
2001
Springer

favoriteEmaildiscussreport

135views Algorithms» more COCO 2001»

Simple Analysis of Graph Tests for Linearity and PCP

13 years 8 months ago

Simple Analysis of Graph Tests for Linearity and PCP

Download www.csc.kth.se

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 ﬁnite ﬁelds, giving a better estimate of the acceptance probability in terms of the distance of the tested function to the closest linear function.

Johan Håstad, Avi Wigderson

Real-time Traffic

Algorithms | Closest Linear Function | COCO 2001 | Low Amortized Query | Simple Analysis |

claim paper

Related Content

» Lower bounds for adaptive linearity tests

» A Simple Test for the Consecutive Ones Property

» An experimental study of a simple distributed edge coloring algorithm

» Mining distancebased outliers in near linear time with randomization and a simple pruning ...

» A simple inductive synthesis methodology and its applications

» On a LowRate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distanc...

» The Ising Model Simple Evolutionary Algorithms as Adaptation Schemes

» Linear Probing and Graphs

» Time Complexity of Distributed Topological Selfstabilization The Case of Graph Linearizati...

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	COCO
Authors	Johan Håstad, Avi Wigderson

Comments (0)