52 citations · 146 across the 26 of their papers we have counts for
8 papers · 1 filter
Graphs of relational structures: restricted types
Andrei A. Bulatov
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In t…
Local structure of idempotent algebras II
Andrei A. Bulatov
In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of su…
Local structure of idempotent algebras I
Andrei A. Bulatov
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems…
The Subpower Membership Problem for Finite Algebras with Cube Terms
Andrei Bulatov, Peter Mayr, Ágnes Szendrei
The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computationa…
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…
Graphs of finite algebras, edges, and connectivity
Andrei A. Bulatov
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems…