52 citations · 146 across the 26 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
A dichotomy theorem for nonuniform CSPs
Andrei A. Bulatov
In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi.
cs.LO2017
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
Andrei A. Bulatov
There are two well known types of algorithms for solving CSPs: local propagation and generating a basis of the solution space. For several years the focus of the CSP research has b…