Approximation resistance from pairwise independent subgroups

Authors:
Siu On Chan
Affiliations:
UC Berkeley, Berkeley, CA, USA
Venue:
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Year:
2013

Citing 55
Cited 0

Optimization, approximation, and complexity classes

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Chernoff-Hoeffding Bounds for Applications with Limited Independence

SIAM Journal on Discrete Mathematics
Derandomized graph products

Computational Complexity
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Recycling queries in PCPs and in linearity tests (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Parallel Repetition Theorem

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

SIAM Journal on Computing
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
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
Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third 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
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

SIAM Journal on Computing
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximations of Independent Sets in Graphs

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Simple analysis of graph tests for linearity and PCP

Random Structures & Algorithms
Probabilistically Checkable Proofs with Low Amortized Query Complexity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Nonapproximability of Non-Boolean Predicates

SIAM Journal on Discrete Mathematics
On Non-Approximability for Quadratic Programs

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Parallel repetition in projection games and a concentration bound

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximation Resistant Predicates from Pairwise Independence

CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
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
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

Random Structures & Algorithms
Linear Level Lasserre Lower Bounds for Certain k-CSPs

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Every 2-csp Allows Nontrivial Approximation

Computational Complexity
CSP gaps and reductions in the lasserre hierarchy

Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems

ACM Transactions on Algorithms (TALG)
Gowers Uniformity, Influence of Variables, and PCPs

SIAM Journal on Computing
On the Approximation Resistance of a Random Predicate

Computational Complexity
Agnostic Learning of Monomials by Halfspaces Is Hard

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Optimal Long Code Test with One Free Bit

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
How to compress interactive communication

Proceedings of the forty-second ACM symposium on Theory of computing
Inapproximability of hypergraph vertex cover and applications to scheduling problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Pseudorandom Bits for Polynomials

SIAM Journal on Computing
Subexponential Algorithms for Unique Games and Related Problems

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
NP-hardness of approximately solving linear equations over reals

Proceedings of the forty-third annual ACM symposium on Theory of computing
On Yao's XOR-lemma

Studies in complexity and cryptography
Satisfying degree-d equations over GF[2]n

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A Two Prover One Round Game with Strong Soundness

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Bypassing UGC from some optimal geometric inapproximability results

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness of the k-route cut problem

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating rooted Steiner networks

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating Max kCSP - outperforming a random assignment with almost a linear factor

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A new point of NP-hardness for unique games

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the Usefulness of Predicates

CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)
Hardness of Finding Independent Sets in Almost q-Colorable Graphs

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Towards an optimal query efficient PCP?

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show optimal (up to constant factor) NP-hardness for Max-k-CSP over any domain, whenever k is larger than the domain size. This follows from our main result concerning predicates over abelian groups. We show that a predicate is approximation resistant if it contains a subgroup that is balanced pairwise independent. This gives an unconditional analogue of Austrin--Mossel hardness result, bypassing the Unique-Games Conjecture for predicates with an abelian subgroup structure. Our main ingredient is a new gap-amplification technique inspired by XOR-lemmas. Using this technique, we also improve the NP-hardness of approximating Independent-Set on bounded-degree graphs, Almost-Coloring, Two-Prover-One-Round-Game, and various other problems.