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....
Главные авторы: | Fulla, P, Zivny, S |
---|---|
Формат: | Conference item |
Опубликовано: |
Dagstuhl Publishing
2016
|
Схожие документы
-
On planar valued CSPs
по: Fulla, P, и др.
Опубликовано: (2017) -
The complexity of Boolean surjective general-valued CSPs
по: Fulla, P, и др.
Опубликовано: (2017) -
The complexity of Boolean surjective general-valued CSPs
по: Fulla, P, и др.
Опубликовано: (2017) -
The complexity of Boolean surjective general-valued CSPs
по: Fulla, P, и др.
Опубликовано: (2018) -
The complexity of finite-valued CSPs
по: Thapper, J, и др.
Опубликовано: (2016)