Approximation Resistant Predicates from Pairwise Independence
- 1 June 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 249-258
- https://doi.org/10.1109/ccc.2008.20
Abstract
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the unique games conjecture. Specifically, we show that a predicate P is approximation resistant if there exists a balanced pairwise independent distribution over [q]k whose support is contained in the set of satisfying assignments to P. Using constructions of pairwise independent distributions this result implies that ldr For general kges3 and qges2, the MAX k-CSPq problem is UG-hard to approximate within O(kq2)/qk+isin. ldr For the special case of q=2, i.e., boolean variables, we can sharpen this bound to (k+O(k0.525))/2k+isin, improving upon the best previous bound of2k/2k+isin (Samorodnitsky and Trevisan, STOC'06) by essentially a factor 2. ldr Finally, again for q=2, assuming that the famous Hadamard conjecture is true, this can be improved even further, and the O(k0.525) term can be replaced by the constant 4.Keywords
This publication has 17 references indexed in Scilit:
- Parallel repetition in projection games and a concentration boundPublished by Association for Computing Machinery (ACM) ,2008
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?SIAM Journal on Computing, 2007
- Gowers uniformity, influence of variables, and PCPsPublished by Association for Computing Machinery (ACM) ,2006
- Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear FactorLecture Notes in Computer Science, 2005
- More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSPLecture Notes in Computer Science, 2005
- The Nonapproximability of Non-Boolean PredicatesSIAM Journal on Discrete Mathematics, 2004
- Some optimal inapproximability resultsJournal of the ACM, 2001
- Parallel Approximation Algorithms by Positive Linear ProgrammingAlgorithmica, 1998
- Pairwise Independent Random VariablesThe Annals of Probability, 1980
- On Orthogonal MatricesJournal of Mathematics and Physics, 1933