The limits of SDP relaxations for general-valued CSPs
<p>It has been shown that for a general-valued constraint language $\Gamma$ the following statements are equivalent: (1) any instance of $\operatorname{VCSP}(\Gamma)$ can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy; (2) any instance of $\operatorname{VCSP}(...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
ACM/IEEE
2017
|