On the NP-Hardness of Max-Not-2.
SIAM Journal on Computing(2012)
摘要
We prove that, for any epsilon > 0, given a satisfiable instance of Max-NTW (Not-2), it is NP-hard to find an assignment that satisfies a fraction 5/8 + epsilon of the constraints. This, up to the existence of epsilon, matches the approximation ratio obtained by the trivial algorithm that just picks an assignment at random, and thus the result is tight. Said equivalently, the result proves that Max-NTW is approximation resistant on satisfiable instances, and this makes complete our understanding of arity three maximum constraint satisfaction problems with regards to approximation resistance.
更多查看译文
关键词
Constraint Satisfaction Problem, Correlate Space, Extended Game, Approximation Resistance, Label Cover
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络