Algebraic Approach to Promise Constraint Satisfaction
Open Access
- 14 July 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 68 (4), 1-66
- https://doi.org/10.1145/3457606
Abstract
The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the past 20 years. A new version of the CSP, the promise CSP (PCSP), has recently been proposed, motivated by open questions about the approximability of variants of satisfiability and graph colouring. The PCSP significantly extends the standard decision CSP. The complexity of CSPs with a fixed constraint language on a finite domain has recently been fully classified, greatly guided by the algebraic approach, which uses polymorphisms—high-dimensional symmetries of solution spaces—to analyse the complexity of problems. The corresponding classification for PCSPs is wide open and includes some long-standing open questions, such as the complexity of approximate graph colouring, as special cases. The basic algebraic approach to PCSP was initiated by Brakensiek and Guruswami, and in this article, we significantly extend it and lift it from concrete properties of polymorphisms to their abstract properties. We introduce a new class of problems that can be viewed as algebraic versions of the (Gap) Label Cover problem and show that every PCSP with a fixed constraint language is equivalent to a problem of this form. This allows us to identify a “measure of symmetry” that is well suited for comparing and relating the complexity of different PCSPs via the algebraic approach. We demonstrate how our theory can be applied by giving both general and specific hardness/tractability results. Among other things, we improve the state-of-the-art in approximate graph colouring by showing that, for any k≥ 3, it is NP-hard to find a (2k-1)-colouring of a given k-colourable graph.Keywords
Funding Information
- European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme ( 771005 ERC and 681988)
- Austrian Science (P29931 FWF)
- Czech Science Foundation (18-20123S)
- charles university research centre program (UNCE/SCI/022 and PRIMUS/SCI/12)
- UK EPSRC (EP/R034516/1)
This publication has 66 references indexed in Scilit:
- Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity TermsCanadian Journal of Mathematics, 2013
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction ProblemLogical Methods in Computer Science, 2012
- The PCP theorem by gap amplificationJournal of the ACM, 2007
- The Hardness of 3-Uniform Hypergraph ColoringCombinatorica, 2005
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Characterizing Mal’cev conditionsAlgebra universalis, 1973
- Galois theory for post algebras. ICybernetics and Systems Analysis, 1972
- Galois theory for Post algebras. IICybernetics and Systems Analysis, 1969
- Closed systems of functions and predicatesPacific Journal of Mathematics, 1968