On planar valued CSPs
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs). First, we show that intractable Boolean VCSPs have to be self-complementary to be tractable in the planar setting, thus extending a corresponding result of Dvořák and Kupec [ICALP’15] from CSPs to VCSPs....
| Autores principales: | , |
|---|---|
| Formato: | Conference item |
| Publicado: |
Dagstuhl Publishing
2016
|