A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Relatively quantified constraint satisfaction
Constraints
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Proceedings of the forty-second ACM symposium on Theory of computing
SDP gaps for 2-to-1 and other label-cover variants
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Maltsev digraphs have a majority polymorphism
European Journal of Combinatorics
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Quantified Equality Constraints
SIAM Journal on Computing
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
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
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Journal of Artificial Intelligence Research
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Detecting and exploiting subproblem tractability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 0.00 |
A Mal'tsev operation is a ternary operation $\varphi$ that satisfies the identities $\varphi(x,y,y) = \varphi(y,y,x) = x$. Constraint satisfaction problems involving constraints invariant under a Mal'tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroup and near subgroup constraints, and many others. It is also known that any tractable case of the counting constraint satisfaction problem involves only Mal'tsev constraints.The first algorithm solving the arbitrary constraint satisfaction problem with Mal'tsev constraints has been given by Bulatov. However, this algorithm is very sophisticated and relies heavily on advanced algebraic machinery. In this paper, we give a different and much simpler algorithm for this type of constraint.