A Characterization of Approximation Resistance for Even k-Partite CSPs
classification
💻 cs.CC
keywords
approximationcharacterizationcspsevenpartiteresistancealgorithmapproximate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.