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
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
The complexity of general-valued CSPs seen from the other side
-н: Carbonnel, C, зэрэг
Хэвлэсэн: (2018) -
The complexity of valued constraint satisfaction problems
-н: Živný, S
Хэвлэсэн: (2012) -
Approximate counting CSP seen from the other side
-н: Bulatov, A, зэрэг
Хэвлэсэн: (2020) -
Approximate counting CSP seen from the other side
-н: Bulatov, A, зэрэг
Хэвлэсэн: (2019) -
The constraint satisfaction problem: complexity and approximability
-н: Krokhin, A, зэрэг
Хэвлэсэн: (2017)