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...
Prif Awduron: | Carbonnel, C, Romero, M, Živný, S |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Society for Industrial and Applied Mathematics
2022
|
Eitemau Tebyg
-
The complexity of general-valued CSPs seen from the other side
gan: Carbonnel, C, et al.
Cyhoeddwyd: (2018) -
The complexity of valued constraint satisfaction problems
gan: Živný, S
Cyhoeddwyd: (2012) -
Approximate counting CSP seen from the other side
gan: Bulatov, A, et al.
Cyhoeddwyd: (2020) -
Approximate counting CSP seen from the other side
gan: Bulatov, A, et al.
Cyhoeddwyd: (2019) -
The constraint satisfaction problem: complexity and approximability
gan: Krokhin, A, et al.
Cyhoeddwyd: (2017)