The Complexity of Global Cardinality Constraints

@article{Bulatov2009TheCO,
  title={The Complexity of Global Cardinality Constraints},
  author={Andrei A. Bulatov and D{\'a}niel Marx},
  journal={2009 24th Annual IEEE Symposium on Logic In Computer Science},
  year={2009},
  pages={419-428}
}
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(Gamma), the constraint satisfaction problem with global cardinality constraints that allows only relations from the set Gamma. The main result of this paper characterizes sets Gamma that… CONTINUE READING