Approximation Resistant Predicates from Pairwise Independence

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

• Type: Conference
• Year: 2008
• Where: COCO
• Authors: Per Austrin, Elchanan Mossel
• Keywords: Algorithms, Approximation Resistant, COCO 2008, Pairwise Independent Distributions, Unique Games Conjecture