The complexity of Boolean surjective general-valued CSPs
Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with the objective function given as a sum of fixed-arity functions; the values are rational numbers or infinity. In Boolean surjective VCSPs variables take on labels from D={0,1} and an optimal assignment is required...
| Auteurs principaux: | , |
|---|---|
| Format: | Conference item |
| Publié: |
Schloss Dagstuhl
2017
|