中闭半线性约束的多项式时间算法
A polynomial-time algorithm for median-closed semilinear constraints
摘要:
Q^n的一个子集称为半线性(或分段线性),如果它是线性半空间的布尔组合。研究了有理数上的约束满足问题(CSP)在所有约束都是半线性时的计算复杂性。当集合是凸的时,CSP是多项式时间等价于线性规划。一个半线性关系是凸的当且仅当它通过取平均值保持不变。我们的主要结果是一个多项式时间算法的CSP的半线性约束,通过应用中位数。我们还证明了这个类是最大的听话的意义上说,任何较大的类的半线性关系有一个NP-硬CSP。为了说明,我们的类包含所有可以用至多两个变量的线性不等式表示的关系(所谓的TVPI约束),但它也包含许多非凸关系,例如对Q的任意有限子集S的形式为x in S的约束,或者更一般地对常数c和d的形式为x < c或y < d的析取约束。
英文摘要:
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints are semilinear. When the sets are convex the CSP is polynomial-time equivalent to linear programming. A semilinear relation is convex if and only if it is preserved by taking averages. Our main result is a polynomial-time algorithm for the CSP of semilinear constraints that are preserved by applying medians. We also prove that this class is maximally tractable in the sense that any larger class of semilinear relations has an NP-hard CSP. To illustrate, our class contains all relations that can be expressed by linear inequalities with at most two variables (so-called TVPI constraints), but it also contains many non-convex relations, for example constraints of the form x in S for arbitrary finite subset S of Q, or more generally disjunctive constraints of the form x < c or y < d for constants c and d.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。