A characterization of approximation resistance for even k-partite CSPs

Authors:
Per Austrin;Subhash Khot
Affiliations:
Aalto Science Institute and KTH Royal Institute of Technology, Helsinki and Stockholm, Sweden;New York University and University of Chicago, New York and Chicago, USA
Venue:
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Year:
2013

Citing 12
Cited 0

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
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
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

Random Structures & Algorithms
How to Round Any CSP

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Randomly Supported Independence and Resistance

SIAM Journal on Computing
On the Usefulness of Predicates

CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate.