On the Approximation Resistance of a Random Predicate

Authors:
Johan Håstad
Affiliations:
Royal Institute of Technology, Stockholm, Sweden
Venue:
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Year:
2007

Citing 9
Cited 2

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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)
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Tight Characterization of NP with 3 Query PCPs

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Every 2-CSP allows nontrivial approximation

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Gowers uniformity, influence of variables, and PCPs

Proceedings of the thirty-eighth annual 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
Towards Sharp Inapproximability for Any 2-CSP

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A predicate is approximation resistant if no probabilistic polynomial time approximation algorithm can do significantly better then the naive algorithm that picks an assignment uniformly at random. Assuming that the Unique Games Conjecture is true we prove that most Boolean predicates are approximation resistant.