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

TL;DR

This paper characterizes when even $k$-partite CSPs are approximation resistant under the Unique Games Conjecture, providing insights into the complexity of approximating these problems.

Contribution

It offers a new characterization of approximation resistance specifically for $k$-partite CSPs with even predicates, advancing theoretical understanding.

Findings

Provides a characterization of approximation resistance for even $k$-partite CSPs

Assumes the Unique Games Conjecture for the results

Clarifies the complexity landscape of these 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.