Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Denecke, S. Wismath (2018)
Universal Algebra and Applications in Theoretical Computer Science
Phokion Kolaitis, Moshe Vardi (1998)
Conjunctive-query containment and constraint satisfactionJ. Comput. Syst. Sci., 61
P. Hell, J. Nesetril (2008)
Colouring, constraint satisfaction, and complexityComput. Sci. Rev., 2
C. Bessiere, E. Hébrard, Brahim Hnich, T. Walsh (2004)
The Complexity of Global Constraints
A. Bulatov, D. Marx (2009)
The Complexity of Global Cardinality Constraints2009 24th Annual IEEE Symposium on Logic In Computer Science
R. Ladner (1975)
On the Structure of Polynomial Time ReducibilityJ. ACM, 22
N. Creignou, Henning Schnoor, Ilka Schnoor (2008)
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
Bernard Nadel (1995)
Constraint Satisfaction in Prolog: Complexity and Theory-Based HeuristicsInf. Sci., 83
(1997)
J. ACM
B. Larose, Pascal Tesson (2007)
Universal algebra and hardness results for constraint satisfaction problemsElectron. Colloquium Comput. Complex., TR07
L. Barto, M. Kozik (2010)
New Conditions for Taylor Varieties and CSP2010 25th Annual IEEE Symposium on Logic in Computer Science
P. Jeavons, D. Cohen, M. Gyssens (1997)
Closure properties of constraintsJ. ACM, 44
S. Khanna, M. Sudan, L. Trevisan, David Williamson (2001)
The Approximability of Constraint Satisfaction ProblemsSIAM J. Comput., 30
A. Bulatov, M. Valeriote (2008)
Recent Results on the Algebraic Approach to the CSP
A. Bulatov (2006)
A dichotomy theorem for constraint satisfaction problems on a 3-element setJ. ACM, 53
L. Barto, M. Kozik (2009)
Constraint Satisfaction Problems of Bounded Width2009 50th Annual IEEE Symposium on Foundations of Computer Science
D. Marx (2004)
Parameterized complexity of constraint satisfaction problemscomputational complexity, 14
E. Allender, Michael Bauland, N. Immerman, Henning Schnoor, H. Vollmer (2005)
The complexity of satisfiability problems: Refining Schaefer's theoremElectron. Colloquium Comput. Complex., TR04
T. Feder, Moshe Vardi (1999)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM J. Comput., 28
R. Barták (2009)
Constraint Processing
A. Bulatov (2003)
Tractable conservative constraint satisfaction problems18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
Henry Kautz, B. Selman (1992)
Planning as Satisfiability
A. Sciullo (2009)
Natural Language Understanding
U. Montanari (1974)
Networks of constraints: Fundamental properties and applications to picture processingInf. Sci., 7
Eugene Freuder (1978)
Synthesizing constraint expressionsCommun. ACM, 21
Eugene Freuder (1990)
Complexity of K-Tree Structured Constraint Satisfaction Problems
Martin Grohe (2003)
The complexity of homomorphism and constraint satisfaction problems seen from the other side44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
P. Beek (1990)
Reasoning About Qualitative Temporal InformationArtif. Intell., 58
Bulatov (abulatov@cs.sfu.ca), School of computing Science, Simon fraser univerity, 8888 university drive
A. Bulatov, A. Krokhin, B. Larose (2008)
Dualities for Constraint Satisfaction Problems
A. Krokhin, A. Bulatov, P. Jeavons (2003)
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.
C. Bazgan, Marek Karpinski (2005)
On the Complexity of Global Constraint Satisfaction
T. Schaefer (1978)
The complexity of satisfiability problemsProceedings of the tenth annual ACM symposium on Theory of computing
Dániel Marx (dmarx@cs.bme.hu), School of computer Science, tel Aviv university
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.
Communications of the ACM – Association for Computing Machinery
Published: Sep 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.