In a non-uniform Constraint Satisfaction problem CSP (Γ), where Γ is a set of relations on a
unite set A, the goal is to und an assignment of values to variables subject to constraints …

In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a
given set of variables, subject to specified constraints. The CSP is known to be NP-complete …

In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a
given set of variables, subject to specified constraints. The CSP is known to be NP-complete …

We clarify the relationship between the linear commutator and the ordinary commutator by
showing that in any variety satisfying a nontrivial idempotent Mal'cev condition the linear …

These are notes from a multi-year learning seminar on the algebraic approach to Constraint
Satisfaction Problems (CSPs). The main topics covered are the theory of algebraic structures …

We prove that CSP (A) for an idempotent algebra A has bounded relational width if and only
if var (A) omits the unary and affine types. If it has bounded relational width it has relational …

The Constraint Satisfaction Problem (CSP) provides a general framework for many
combinatorial problems. In [AA Bulatov, AA Krokhin, PG Jeavons, Classifying the complexity …

In our LICS 2004 paper we introduced an approach to the study of the local structure of finite
algebras and relational structures that aims at applications in the Constraint Satisfaction …

We refine and advance the study of the local structure of idempotent finite algebras started in
Bulatov (LICS, 2004). We introduce a graph-like structure on an arbitrary finite idempotent …

This paper considers the lattice of subquasivarieties of a regular variety. In particular we
show that if V is a strongly irregular variety that is minimal as a quasivariety, then the …