A Simple Algorithm for Mal'tsev Constraints
From MaRDI portal
Recommendations
- The property of being polynomial for Mal’tsev constraint satisfaction problems
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- Computational complexity of various Mal'cev conditions
- Towards a dichotomy theorem for the counting constraint satisfaction problem
Cited in
(49)- Affine systems of equations and counting infinitary logic
- Relatively quantified constraint satisfaction
- On singleton arc consistency for CSPs defined by monotone patterns
- On Maltsev digraphs
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- Commutative idempotent groupoids and the constraint satisfaction problem.
- Tractability in constraint satisfaction problems: a survey
- The constraint satisfaction problem and universal algebra
- Is polynomial time choiceless?
- On Maltsev digraphs
- On the CSP Dichotomy Conjecture
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- On singleton arc consistency for CSPs defined by monotone patterns
- Equivariant algorithms for constraint satisfaction problems over coset templates
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
- Varieties with few subalgebras of powers
- Colouring, constraint satisfaction, and complexity
- The subpower membership problem for finite algebras with cube terms
- On the number of finite algebraic structures
- Parameterized complexity of the workflow satisfiability problem
- The subpower membership problem for Mal'cev algebras
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Absorption in universal algebra and CSP
- Counting constraint satisfaction problems
- The complexity of valued CSPs
- Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- Solving equation systems in ω-categorical algebras
- Binarisation for valued constraint satisfaction problems
- Quantified constraint satisfaction and the polynomially generated powers property
- Recent Results on the Algebraic Approach to the CSP
- Constraint Satisfaction Problems with Infinite Templates
- A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
- CLAP: A New Algorithm for Promise CSPs
- Maltsev digraphs have a majority polymorphism
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
- Constraint reasoning
- Constraint satisfaction, graph isomorphism, and the pebbling comonad
- Graphs of finite algebras: edges, and connectivity
- The subpower membership problem of 2-nilpotent algebras
- Symmetries and complexity (invited talk)
- Modular counting CSP: reductions and algorithms
- Backdoors into heterogeneous classes of SAT and CSP
- The ideal membership problem and abelian groups
- Hard constraint satisfaction problems have hard gaps at location 1
- The complexity of constraint satisfaction games and QCSP
- A new line of attack on the dichotomy conjecture
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
This page was built for publication: A Simple Algorithm for Mal'tsev Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470744)
