2 papers
math.RA2026
Conservative Maltsev Constraint Satisfaction Problems
Manuel Bodirsky, Andrew Moorhead
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs…
math.RA2025
The class of congruence meet semidistributive varieties is not strong Maltsev
Andrew Moorhead
We present a proof that there is no single finite package of identities which characterizes the class of congruence meet semidistributive varieties.