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)
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
SIAM Journal on Computing
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Towards Sharp Inapproximability For Any 2-CSP
FOCS '07 Proceedings of the 48th Annual IEEE 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
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
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
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Optimal Sherali-Adams Gaps from Pairwise Independence
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
How to play unique games on expanders
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We study the approximability of the MAX k-CSPproblem over non-boolean domains, more specifically over {0,1,...,q茂戮驴 1} for some integer q. We extend the techniques of Samorodnitsky and Trevisan [19] to obtain a UGC hardness result when qis a prime. More precisely, assuming the Unique Games Conjecture, we show that it is NP-hard to approximate the problem to a ratio greater than q2k/qk. Independent of this work, Austrin and Mossel [2] obtain a more general UGC hardness result using entirely different techniques.We also obtain an approximation algorithm that achieves a ratio of C(q) ·k/qkfor some constant C(q) depending only on q, via a subroutine for approximating the value of a semidefinite quadratic form when the variables take values on the corners of the q-dimensional simplex. This generalizes an algorithm of Nesterov [16] for the ±1-valued variables. It has been pointed out to us [15] that a similar approximation ratio can be obtained by reducing the non-boolean case to a boolean CSP.