全局基数约束的复杂性
The complexity of global cardinality constraints
摘要：
在约束满足问题（CSP）中，目标是找到一组给定的变量在特定约束下的分配。全局基数约束是一个额外的要求，它规定了必须为多少个变量分配某个值。我们研究了问题CCSP（G）的复杂性，CCSP（G）是一个具有全局基数约束的约束满足问题，它只允许来自集合G的关系。本文的主要结果刻画了集合G的特征，这些集合G产生了在多项式时间内可解的问题，并指出剩余的此类问题是NP-完全的。
英文摘要：
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value. We study the complexity of the problem CCSP(G), the constraint satisfaction problem with global cardinality constraints that allows only relations from the set G. The main result of this paper characterizes sets G that give rise to problems solvable in polynomial time, and states that the remaining such problems are NP-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
