On the complexity of H-coloring
Journal of Combinatorial Theory Series B
The set of types of a finitely generated variety
Discrete Mathematics
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
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
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Generalized Majority-Minority Operations are Tractable
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
A Characterisation of First-Order Constraint Satisfaction Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Constraints, consistency and closure
Artificial Intelligence
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th 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
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
On the containment of forbidden patterns problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Generic expression hardness results for primitive positive formula comparison
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Generic expression hardness results for primitive positive formula comparison
Information and Computation
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 0.02 |
We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic framework.