52 citations · 146 across the 26 of their papers we have counts for
30 papers
Complexity classification of counting graph homomorphisms modulo a prime number
Andrei A. Bulatov, Amirhossein Kazeminia
Counting graph homomorphisms and its generalizations such as the Counting Constraint Satisfaction Problem (CSP), its variations, and counting problems in general have been intensiv…
On the Complexity of CSP-based Ideal Membership Problems
Andrei A. Bulatov, Akbar Rafiey
In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials and the question is to decide whether belo…
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…
A dichotomy theorem for nonuniform CSPs simplified
Andrei A. Bulatov
In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constr…
Separation of congruence intervals and implications
Andrei A. Bulatov
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal alge…
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…