Necessary conditions for tractability of valued CSPs
The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP’13] have characterised a Galois connection between valued constraint languages and so-called weighted clon...
| Main Authors: | , |
|---|---|
| 格式: | Journal article |
| 出版: |
Society for Industrial and Applied Mathematics
2015
|