Algebraic Approach to Promise Constraint Satisfaction
Journal of the ACM · 2021-08 · 68 (4) · 1-66
DOI: 10.1145/3457606 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 14.07.2021. Verfasst von Libor Barto und 3 weiteren Autor:innen. Die Arbeit wurde bisher 57-mal zitiert (Crossref) und nennt 92 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme, Austrian Science, Czech Science Foundation.
Abstract (Originalsprache)
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 (2 k -1)-colouring of a given k -colourable graph.
Förderung
- European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme
- Austrian Science
- Czech Science Foundation
- Charles University Research Centre program
- UK EPSRC
Zitieren
APA
Barto, L., Bulín, J., Krokhin, A., & Opršal, J. (2021). Algebraic Approach to Promise Constraint Satisfaction. Journal of the ACM, 68(4), 1-66. https://doi.org/10.1145/3457606
Vancouver
Barto L, Bulín J, Krokhin A, Opršal J. Algebraic Approach to Promise Constraint Satisfaction. Journal of the ACM. 2021;68(4):1-66. doi:10.1145/3457606
BibTeX
@article{Barto2021,
author = {Barto, Libor and Bulín, Jakub and Krokhin, Andrei and Opršal, Jakub},
title = {Algebraic Approach to Promise Constraint Satisfaction},
journal = {Journal of the ACM},
year = {2021},
volume = {68},
number = {4},
pages = {1--66},
doi = {10.1145/3457606}
}
EUVIMED