Beyond boolean surjective VCSPs
Fulla, Uppman, and Živný [ACM ToCT’18] established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution. This result, in addition to identifying the complexity frontie...
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Conference item |
| Gepubliceerd in: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2019
|