arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00913math.LO
收藏

证明CSP的复杂性

Proof complexity of CSP

Azza Gaysin

摘要:

约束满足问题是一类判定实例关系结构到目标关系结构是否存在同态的问题。CSP二分法是最近由Zhuk(2020,J. ACM,67)和Bulatov(2017,FOCS,58)证明的一个深刻的结果。它建立了任何固定的目标结构,CSP是NP完全或$p$时间可解的。Zhuk的算法在多项式时间内解决了具有弱近似多态性的约束语言的CSP。对于$p$ -时间CSP的负实例,探索其证明复杂度是合理的。我们证明了Zhuk算法的可靠性可以在有界算术理论中得到证明,即在由三个特殊的泛代数公理扩充的$V^1$理论中。这意味着任何模拟扩展归结和证明这三个公理的理论的命题证明系统都允许对固定$p$时间CSP的所有否定实例进行$p$大小的证明。

英文摘要:

The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J. ACM, 67) and Bulatov (2017, FOCS, 58). It establishes that for any fixed target structure, CSP is either NP-complete or $p$-time solvable. Zhuk's algorithm solves CSP in polynomial time for constraint languages having a weak near-unanimity polymorphism. For negative instances of $p$-time CSPs, it is reasonable to explore their proof complexity. We show that the soundness of Zhuk's algorithm can be proved in a theory of bounded arithmetic, namely in the theory $V^1$ augmented by three special universal algebra axioms. This implies that any propositional proof system that simulates both Extended Resolution and a theory that proves the three axioms admits $p$-size proofs of all negative instances of a fixed $p$-time CSP.

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

↑