2000 character limit reached
A Characterization of Approximation Resistance for Even $k$-Partite CSPs
Published 12 Jan 2013 in cs.CC | (1301.2731v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
