Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Fast parallel constraint satisfaction
Artificial Intelligence
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On the tractability of smooth constraint satisfaction problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. In this paper we show that any restricted set of constraint types can be associated with a finite universal algebra. We explore how the computational complexity of a restricted constraint satisfaction problem is connected to properties of the corresponding algebra. Using these results we exhibit a common structural property of all known intractable constraint satisfaction problems. Finally, we classify all finite strictly simple surjective algebras with respect to tractability. The result is a dichotomy theorem which significantly generalises Schaefer's dichotomy for the Generalised Satisfiability problem.