More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomly supported independence and resistance
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)
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
On the inapproximability of vertex cover on k-partite k-uniform hypergraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to play unique games on expanders
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Proceedings of the forty-third annual ACM symposium on Theory of computing
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
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
A characterization of approximation resistance for even k-partite CSPs
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the usefulness of predicates
ACM Transactions on Computation Theory (TOCT)
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
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.