251. Finitely Tractable Promise Constraint Satisfaction Problems
- Author
-
Asimi, Kristina, Barto, Libor, Bonchi, Filippo, and Puglisi, Simon J.
- Subjects
FOS: Computer and information sciences ,Boolean PCSP ,Constraint satisfaction problems ,Theory of computation → Problems, reductions and completeness ,homomorphic relaxation ,Mathematics - Logic ,Computer Science::Computational Complexity ,Computational Complexity (cs.CC) ,promise constraint satisfaction ,finite tractability ,68Q17 ,polymorphism ,Computer Science - Computational Complexity ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Theory of computation → Constraint and logic programming ,FOS: Mathematics ,F.1.3 ,Logic (math.LO) - Abstract
The Promise Constraint Satisfaction Problem (PCSP) is a generalization of the Constraint Satisfaction Problem (CSP) that includes approximation variants of satisfiability and graph coloring problems. Barto [LICS '19] has shown that a specific PCSP, the problem to find a valid Not-All-Equal solution to a 1-in-3-SAT instance, is not finitely tractable in that it can be solved by a trivial reduction to a tractable CSP, but such a CSP is necessarily over an infinite domain (unless P=NP). We initiate a systematic study of this phenomenon by giving a general necessary condition for finite tractability and characterizing finite tractability within a class of templates - the "basic" tractable cases in the dichotomy theorem for symmetric Boolean PCSPs allowing negations by Brakensiek and Guruswami [SODA'18]., LIPIcs, Vol. 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), pages 11:1-11:16
- Published
- 2020
- Full Text
- View/download PDF