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 …

The complexity and approximability of the constraint satisfaction problem (CSP) has been
actively studied over the past 20 years. A new version of the CSP, the promise CSP (PCSP) …

Polymorphisms, and How to Use Them Page 1 Polymorphisms, and How to Use Them Libor Barto
∗1, Andrei Krokhin2, and Ross Willard †3 1 Department of Algebra, Faculty of Mathematics and …

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a
fixed template is that pp-interpretations between at most countable ω-categorical relational …

We present dynamic algorithms with polylogarithmic update time for estimating the size of
the maximum matching of a graph undergoing edge insertions and deletions with …

We study the computational complexity of exact minimization of rational-valued discrete
functions. Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is …

We study the use of local consistency methods as reductions between constraint satisfaction
problems (CSPs), and promise version thereof, with the aim to classify these reductions in a …

We introduce the novel machinery of smooth approximations to provide a systematic
algebraic approach to the complexity of CSPs over finitely bounded homogeneous …

An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of
variables, a finite domain of labels, and a sum of functions, each function depending on a …

We propose a new algorithm for Promise Constraint Satisfaction Problems (PCSPs). It is a
combination of the Constraint Basic LP relaxation and the Affine IP relaxation (CLAP). We …