eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-03-10
10:1
10:16
10.4230/LIPIcs.STACS.2021.10
article
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case
Barto, Libor
1
https://orcid.org/0000-0002-8481-6458
Battistelli, Diego
1
Berg, Kevin M.
1
https://orcid.org/0000-0002-1555-4239
Department of Algebra, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
The Promise Constraint Satisfaction Problem (PCSP) is a recently introduced vast generalization of the Constraint Satisfaction Problem (CSP). We investigate the computational complexity of a class of PCSPs beyond the most studied cases - approximation variants of satisfiability and graph coloring problems. We give an almost complete classification for the class of PCSPs of the form: given a 3-uniform hypergraph that has an admissible 2-coloring, find an admissible 3-coloring, where admissibility is given by a ternary symmetric relation. The only PCSP of this sort whose complexity is left open in this work is a natural hypergraph coloring problem, where admissibility is given by the relation "if two colors are equal, then the remaining one is higher."
https://drops.dagstuhl.de/storage/00lipics/lipics-vol187-stacs2021/LIPIcs.STACS.2021.10/LIPIcs.STACS.2021.10.pdf
constraint satisfaction problems
promise constraint satisfaction
Boolean PCSP
polymorphism