Small Promise CSPs that reduce to large CSPs
For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B. We are promised that the input satisfies exactly one of these two cases. If there exists a structure...
Main Authors: | Alexandr Kazda, Peter Mayr, Dmitriy Zhuk |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/8495/pdf |
Similar Items
-
Tractable Combinations of Temporal CSPs
by: Manuel Bodirsky, et al.
Published: (2022-05-01) -
Conditional Dichotomy of Boolean Ordered Promise CSPs
by: Joshua Brakensiek, et al.
Published: (2023-01-01) -
The Subpower Membership Problem for Finite Algebras with Cube Terms
by: Andrei Bulatov, et al.
Published: (2019-02-01) -
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Dušan Knop, et al.
Published: (2019-12-01) -
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
by: Martin C. Cooper, et al.
Published: (2017-12-01)