The limits of SDP relaxations for general-valued CSPs
It has been shown that for a general-valued constraint language Γ the following statements are equivalent: (1) any instance of VCSP(Γ) can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy, (2) any instance of VCSP(Γ) can be solved to optimality using the third level o...
主要な著者: | Thapper, J, Zivny, S |
---|---|
フォーマット: | Journal article |
出版事項: |
Association for Computing Machinary
2018
|
類似資料
-
The limits of SDP relaxations for general-valued CSPs
著者:: Thapper, J, 等
出版事項: (2017) -
The power of Sherali-Adams relaxations for general-valued CSPs
著者:: Thapper, J, 等
出版事項: (2015) -
The power of Sherali-Adams relaxations for general-valued CSPs
著者:: Thapper, J, 等
出版事項: (2017) -
Sherali-Adams relaxations for valued CSPs
著者:: Thapper, J, 等
出版事項: (2015) -
The complexity of finite-valued CSPs
著者:: Thapper, J, 等
出版事項: (2016)