Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Constraint satisfaction in Prolog: complexity and theory-based heuristics
Information Sciences—Intelligent Systems: An International Journal
Closure properties of constraints
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Universal Algebra and Applications in Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Constraint Processing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Parameterized complexity of constraint satisfaction problems
Computational Complexity
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The Complexity of Global Cardinality Constraints
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
New Conditions for Taylor Varieties and CSP
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 48.22 |
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(Γ), the CSP 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.