The complexity of general-valued constraint satisfaction problems seen from the other side

The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand-side structures, the results of Dalmau, Kolaitis, and Vardi [Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, Spri...

Полное описание

Библиографические подробности
Главные авторы: Carbonnel, C, Romero, M, Živný, S
Формат: Journal article
Язык:English
Опубликовано: Society for Industrial and Applied Mathematics 2022

Схожие документы