A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Algebraic Characterization of Tractable Constraints
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Perfect Constraints Are Tractable
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Integer programming with 2-variable equations and 1-variable inequalities
Information Processing Letters
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Testing expressibility is hard
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
We describe the constraint satisfaction problem and show that it unifies a very wide variety of computational problems. We discuss the techniques that have been used to analyse the complexity of different forms of constraint satisfaction problem, focusing on the algebraic approach, and highlight some of the recent results in this area.