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....
Prif Awduron: | Fulla, P, Zivny, S |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
Dagstuhl Publishing
2016
|
Eitemau Tebyg
-
On planar valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2017) -
The complexity of Boolean surjective general-valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2017) -
The complexity of Boolean surjective general-valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2017) -
The complexity of Boolean surjective general-valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2018) -
The complexity of finite-valued CSPs
gan: Thapper, J, et al.
Cyhoeddwyd: (2016)