A Characterization of Approximation Resistance for Even $k$-Partite CSPs
Computational Complexity
2013-01-15 v1
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 -partite CSPs defined by an even predicate.
Keywords
Cite
@article{arxiv.1301.2731,
title = {A Characterization of Approximation Resistance for Even $k$-Partite CSPs},
author = {Per Austrin and Subhash Khot},
journal= {arXiv preprint arXiv:1301.2731},
year = {2013}
}