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)