The complexity of Boolean surjective general-valued CSPs
Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q ∪ {∞})-valued objective function given as a sum of fixed-arity functions. In Boolean surjective VCSPs, variables take on labels from D = {0, 1} and an optimal assignment is required to use both labels from D...
| Główni autorzy: | , , |
|---|---|
| Format: | Journal article |
| Wydane: |
Association for Computing Machinery
2018
|