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

难覆盖CSP的特征

A Characterization of hard-to-cover CSPs

Amey Bhangale, Prahladh Harsha, Girish Varma

摘要:

我们继续研究由Guruswami,Hastad和Sudan [SIAM J. Comp. 2002]和Dinur和Kol [CCC'13]提出的约束满足问题(CSP)的覆盖复杂性。CSP实例$Φ$的覆盖数是对$Φ$的变量的赋值的最小数目,使得$Φ$的每个约束被至少一个赋值满足。结果表明:1.假设Dinur和Kol引入的唯一博弈猜想的覆盖变体,我们证明了对于任何常数大小字母表上的每个非奇谓词$P$和每个整数$K$,在$K$的因子内近似覆盖数是NP困难的。这产生了一个完整的表征CSP在恒定大小的字母,很难覆盖。2.对于一个大类的谓词中所包含的2k-LIN谓词,我们表明,它是准NP-难以区分的覆盖数最多$2$和覆盖数至少$Ω(\log\log n)$的实例。这推广和改进了Dinur和Kol的4-LIN覆盖硬度结果。

英文摘要:

We continue the study of the covering complexity of constraint satisfaction problems (CSPs) initiated by Guruswami, Håstad and Sudan [SIAM J. Comp. 2002] and Dinur and Kol [CCC'13]. The covering number of a CSP instance $Φ$ is the smallest number of assignments to the variables of $Φ$, such that each constraint of $Φ$ is satisfied by at least one of the assignments. We show the following results: 1. Assuming a covering variant of the Unique Games Conjecture, introduced by Dinur and Kol, we show that for every non-odd predicate $P$ over any constant-size alphabet and every integer $K$, it is NP-hard to approximate the covering number within a factor of $K$. This yields a complete characterization of CSPs over constant-size alphabets that are hard to cover. 2. For a large class of predicates that are contained in the 2k-LIN predicate, we show that it is quasi-NP-hard to distinguish between instances with covering number at most $2$ and those with covering number at least $Ω(\log\log n)$. This generalizes and improves the 4-LIN covering hardness result of Dinur and Kol.

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

↑