Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials
Bart M. P. Jansen, Astrid Pieterse
备注:
Updated the cross-composition in lemma 18 (minor update), since the previous version did NOT satisfy requirement 4 of lemma 18 (the proof of Claim 20 was incorrect)
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.
Computational Short Cuts in Infinite Domain Constraint Satisfaction
Linköpings Universitet(林雪平大学);University of Leeds(利兹大学)
有限域CSP实例中的后门是一组变量,其中每个可能的实例化将实例移动到多项式时间可解类中。后门在人工智能和其他领域有着广泛的应用,因此寻找后门的算法问题也得到了深入的研究。Sioutis和Janhunen(Proc. 42 nd German Conference on AI(KI-2019))提出了一种适用于二进制约束下无限域CSP实例的通用后门概念。我们概括他们的概念到一个大类的CSP,允许higher-arity约束。我们表明,这种无限域后门有许多积极的计算性质,有限域后门有:相关的计算问题是固定参数易处理的底层约束语言是有限的。另一方面,我们证明了无限语言使问题变得相当困难:一般的后门检测问题是W[2]-hard的,并且在标准复杂性理论假设下排除了固定参数的易处理性。我们证明了后门可能对二进制约束有次优行为-从人工智能的角度来看,这是有害的,其中二进制约束在例如时空应用程序中占主导地位。针对这一点,我们引入了sidedoors作为后门的替代方案。侧门的基本计算问题仍然是固定参数的有限约束语言(可能也包含非二进制关系)。此外,侧门方法具有吸引人的计算特性,有时会导致比后门方法更快的算法。
University of California, Berkeley(加州大学伯克利分校);Simons Institute for the Theory of Computing and the University of California, Berkeley(计算理论西蒙斯研究所和加州大学伯克利分校);Eindhoven University of Technology, The Netherlands(埃因霍温理工大学);Royal Holloway, University of London(伦敦大学皇家霍洛威学院)