Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

LICS
2009
IEEE

favoriteEmaildiscussreport

119views Automated Reasoning» more LICS 2009»

The Complexity of Global Cardinality Constraints

13 years 11 months ago

The Complexity of Global Cardinality Constraints

Download www.cs.bme.hu

In a constraint satisfaction problem (CSP) the goal is to ﬁnd an assignment of a given set of variables subject to speciﬁed 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(Γ), the constraint satisfaction problem with global cardinality constraints that allows only relations from the set Γ. The main result of this paper characterizes sets Γ that give rise to problems solvable in polynomial time, and states that the remaining such problems are NP-complete.

Andrei A. Bulatov, Dániel Marx

Real-time Traffic

Computer Science | Constraint Satisfaction Problem | Global Cardinality Constraints | LICS 2009 | Paper Characterizes Sets |

claim paper

Related Content

» Improved Algorithm for the Soft Global Cardinality Constraint

» Tractable Cases of the Extended Global Cardinality Constraint

» The Complexity of Global Constraints

» The Matching Predicate and a Filtering Scheme Based on Matroids

» On Global Warming Softening Global Constraints

» The Cardinality Matrix Constraint

» Improved Algorithms for the Global Cardinality Constraint

» Constraint satisfaction problems and global cardinality constraints

» Combination of Among and Cardinality Constraints

Post Info
More Details (n/a)

Added	24 May 2010
Updated	24 May 2010
Type	Conference
Year	2009
Where	LICS
Authors	Andrei A. Bulatov, Dániel Marx

Comments (0)