A Characterization of Approximation Resistance for Even $k$-Partite CSPs

Abstract

A constraint satisfaction problem (CSP) is said to be \emph{approximation resistant} if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for $k$-partite CSPs defined by an even predicate.

References in corpus (1)

• On the Usefulness of Predicates