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...

Full description

Bibliographic Details
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