The limits of SDP relaxations for general-valued CSPs

The limits of SDP relaxations for general-valued CSPs
复制标题

普通价值 CSP 的 SDP 放宽限制

DOI:
--
复制
发表时间:
2016
期刊:
Logic in Computer Science
影响因子:
--
通讯作者:
Stanislav Živný
Stanislav Živný
中科院分区:
--
文献类型:
--
作者:
Johan Thapper;Stanislav Živný

文献摘要

参考文献

被引文献

相似文献

证明了对于一般值约束语言Γ,下列语句是等价的:(1)VCSP(Γ)的任何实例都可以用Sherali-Adams LP层次的一个常数层求解到最优性;(2)VCSP(Γ)的任何实例都可以用Sherali-Adams LP层次的第三层求解到最优性;(3)Γ的支撑满足“有界宽度条件”,即,它包含了所有节点的弱近似运算。
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 of the Sherali-Adams LP hierarchy; (3) the support of Γ satisfies the “bounded width condition”, i.e., it contains weak near-unanimity operations of all arities.
DOI: 10.1137/130906398
发表时间: 2013
影响因子: 1.6
作者:
Cohen D
通讯作者: Cohen D
通用价值 CSP 的复杂性
DOI: 10.1109/focs.2015.80
发表时间: 2015
期刊: --
影响因子: --
作者:
Kolmogorov V
通讯作者: Kolmogorov V