3 research outputs found

    Approximation Resistant Predicates From Pairwise Independence

    Full text link
    We study the approximability of predicates on kk variables from a domain [q][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 PP is approximation resistant if there exists a balanced pairwise independent distribution over [q]k[q]^k whose support is contained in the set of satisfying assignments to PP
    corecore