Simple Analysis of Graph Tests for Linearity and PCP

Authors:
Johan Håstad;Avi Wigderson
Affiliations:
-;-
Venue:
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Year:
2001

Citing 0
Cited 4

Monotonicity testing over general poset domains

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Towards an optimal query efficient PCP?

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.