Simple analysis of graph tests for linearity and PCP

Authors:
Johan Håstad;Avi Wigderson
Affiliations:
Department of Numerical Analysis and Computer Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden;Department of Computer Science, Hebrew University, Jerusalem, Israel and School of Mathematics, Institute for Advanced Study, Princeton, New Jersey
Venue:
Random Structures & Algorithms
Year:
2003

Citing 13
Cited 30

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Hardness vs randomness

Journal of Computer and System Sciences
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
A PCP characterization of NP with optimal amortized query complexity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some optimal inapproximability results

Journal of the ACM (JACM)
Linear-consistency testing

Journal of Computer and System Sciences
Probabilistically checkable proofs and the testing of hadamard-like codes

Probabilistically checkable proofs and the testing of hadamard-like codes
Linearity testing in characteristic two

IEEE Transactions on Information Theory - Part 1

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient testing of groups

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Gowers uniformity, influence of variables, and PCPs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Non-Abelian homomorphism testing, and distributions close to their self-convolutions

Random Structures & Algorithms
Finding large 3-free sets I: The small n case

Journal of Computer and System Sciences
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

Random Structures & Algorithms
A Hypergraph Dictatorship Test with Perfect Completeness

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Two-query PCP with subconstant error

Journal of the ACM (JACM)
Derandomizing graph tests for homomorphism

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Proceedings of the forty-second ACM symposium on Theory of computing
A query efficient non-adaptive long code test with perfect completeness

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the derandomization of the graph test for homomorphism over groups

Theoretical Computer Science
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)

SIAM Journal on Computing
Query-efficient dictatorship testing with perfect completeness

Property testing
Query-efficient dictatorship testing with perfect completeness

Property testing
Characterizations of locally testable linear-and affine-invariant families

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Black-box reductions in mechanism design

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Characterizations of locally testable linear- and affine-invariant families

Theoretical Computer Science
On the communication and streaming complexity of maximum bipartite matching

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Beating a random assignment

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Testing periodicity

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Nearly complete graphs decomposable into large induced matchings and their applications

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sublinear Time Algorithms

SIAM Journal on Discrete Mathematics
Approximation resistance from pairwise independent subgroups

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.