arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0712.1532cs.CC
收藏

硬约束满足问题在位置1有硬缺口

Hard constraint satisfaction problems have hard gaps at location 1

Peter Jonsson, Andrei Krokhin, Fredrik Kuivinen

摘要:

Max CSP的实例是一组变量上的有限约束集合,目标是为变量赋值,使满足的约束数量最大化。Max CSP捕获了许多众所周知的问题(例如Max k-SAT和Max Cut),因此是NP难的。因此,研究对允许的约束类型(或约束语言)的限制如何影响Max CSP的复杂性和可逼近性是很自然的。PCP定理等价于存在一种约束语言,对于这种语言,Max CSP在位置1处有一个硬间隙,即区分可满足的实例和至多有一个常数部分约束可满足的实例是NP困难的。所有的约束语言,其中CSP问题(即,决定是否可以满足所有约束的问题)目前已知是NP-难的,具有一定的代数性质。我们证明,任何约束语言与此代数属性使最大CSP有一个硬间隙在位置1,特别是,这意味着这样的问题不能有一个PTAS,除非P = NP。然后,我们将此结果应用于限制为单个约束类型的最大CSP;这类问题包含,例如,最大切割和最大DiCut。假设P $\neq$ NP,我们表明,这样的问题不承认PTAS除了在一些平凡的情况下。即使每个变量的出现次数由一个常数限定,我们的结果也成立。我们使用这些结果来部分回答开放性问题,并加强Engebretsen等人的结果。Comput.科学,312(2004),pp. 17- 45],Feder等人[离散数学,307(2007),pp. 386- 392],Krokhin和Larose [Proc. Principles and Practice of Constraint Programming(2005),pp. 388- 402],以及Jonsson和Krokhin [J.系统科学,73(2007),pp. 691- 702]

英文摘要:

An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint languages) affect the complexity and approximability of Max CSP. The PCP theorem is equivalent to the existence of a constraint language for which Max CSP has a hard gap at location 1, i.e. it is NP-hard to distinguish between satisfiable instances and instances where at most some constant fraction of the constraints are satisfiable. All constraint languages, for which the CSP problem (i.e., the problem of deciding whether all constraints can be satisfied) is currently known to be NP-hard, have a certain algebraic property. We prove that any constraint language with this algebraic property makes Max CSP have a hard gap at location 1 which, in particular, implies that such problems cannot have a PTAS unless P = NP. We then apply this result to Max CSP restricted to a single constraint type; this class of problems contains, for instance, Max Cut and Max DiCut. Assuming P $\neq$ NP, we show that such problems do not admit PTAS except in some trivial cases. Our results hold even if the number of occurrences of each variable is bounded by a constant. We use these results to partially answer open questions and strengthen results by Engebretsen et al. [Theor. Comput. Sci., 312 (2004), pp. 17--45], Feder et al. [Discrete Math., 307 (2007), pp. 386--392], Krokhin and Larose [Proc. Principles and Practice of Constraint Programming (2005), pp. 388--402], and Jonsson and Krokhin [J. Comput. System Sci., 73 (2007), pp. 691--702]

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑