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)