arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.03233cs.CC
收藏

基于低次多项式的二元CSP最优稀疏化

Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials

Bart M. P. Jansen, Astrid Pieterse

摘要:

本文分析了在不改变答案的前提下,如何有效地减少NP难可满足性问题的子句数量。使用核化的概念建立上界和下界。现有的结果表明,如果NP不包含在coNP/poly中,则没有有效的预处理算法可以将每个子句具有d个字面值的CNF-SAT的n变量实例减少到具有$O(n^{d-e})$位的等价实例,对于任何e > 0。对于不全相等SAT问题,存在大小为$Õ(n^{d-1})$的压缩。我们把这些结果在一个共同的框架,通过分析二进制CSP的可压缩性。我们的特征约束类型的基础上的最小程度的多元多项式的根对应于令人满意的任务,获得(几乎)匹配的上限和下限在几个设置。我们的下限表明,不仅约束的数量,而且编码的大小的个别约束起着重要的作用。例如,对于具有无限子句长度的精确可满足性,可以有效地将约束的数量减少到n+1,但是对于任何e > 0,没有多项式时间算法可以减少到具有$O(n^{2-e})$位的等价实例,除非NP是coNP/poly的子集。

英文摘要:

This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP is not contained in coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of CNF-SAT with d literals per clause, to equivalent instances with $O(n^{d-e})$ bits for any e > 0. For the Not-All-Equal SAT problem, a compression to size $Õ(n^{d-1})$ exists. We put these results in a common framework by analyzing the compressibility of binary CSPs. We characterize constraint types based on the minimum degree of multivariate polynomials whose roots correspond to the satisfying assignments, obtaining (nearly) matching upper and lower bounds in several settings. Our lower bounds show that not just the number of constraints, but also the encoding size of individual constraints plays an important role. For example, for Exact Satisfiability with unbounded clause length it is possible to efficiently reduce the number of constraints to n+1, yet no polynomial-time algorithm can reduce to an equivalent instance with $O(n^{2-e})$ bits for any e > 0, unless NP is a subset of coNP/poly.

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

↑