1. On polynomial time computation over unordered structures;Blass;Journal of Symbolic Logic,2002
2. Galois theory for post algebras. i;Bodnarchuk;Kibernetika,1969
3. A simple algorithm for Mal’tsev constraints;Bulatov;SIAM Journal on Computing,2006
4. Classifying the complexity of constraints using finite algebras;Bulatov;SIAM Journal on Computing,2005
5. A.A. Bulatov, Mal’tsev constraints are tractable, Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002