Proof complexity meets algebra
Document typeConference report
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Rights accessOpen Access
European Commisision's projectAUTAR - A Unified Theory of Algorithmic Relaxations (EC-H2020-648276)
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional and semi-algebraic proof systems, the classical constructions of pp-interpretability, homomorphic equivalence and addition of constants to a core preserve the proof complexity of the CSP. As a result, for those proof systems, the classes of constraint languages for which small unsatisfiability certificates exist can be characterised algebraically. We illustrate our results by a gap theorem saying that a constraint language either has resolution refutations of bounded width, or does not have bounded-depth Frege refutations of subexponential size. The former holds exactly for the widely studied class of constraint languages of bounded width. This class is also known to coincide with the class of languages with Sums-of-Squares refutations of sublinear degree, a fact for which we provide an alternative proof. We hence ask for the existence of a natural proof system with good behaviour with respect to reductions and simultaneously small size refutations beyond bounded width. We give an example of such a proof system by showing that bounded-degree Lovasz-Schrijver satisfies both requirements.
CitationAtserias, A., Ochremiak, J. Proof complexity meets algebra. A: International Colloquium on Automata, Languages, and Programming. "44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)". Varsòvia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 110:1-110:14.