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...
Main Authors: | Carbonnel, C, Romero, M, Živný, S |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics
2022
|
Similar Items
-
The complexity of general-valued CSPs seen from the other side
by: Carbonnel, C, et al.
Published: (2018) -
The complexity of valued constraint satisfaction problems
by: Živný, S
Published: (2012) -
Approximate counting CSP seen from the other side
by: Bulatov, A, et al.
Published: (2020) -
Approximate counting CSP seen from the other side
by: Bulatov, A, et al.
Published: (2019) -
The constraint satisfaction problem: complexity and approximability
by: Krokhin, A, et al.
Published: (2017)