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)