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 …

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) …

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 …

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

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 …

We study the power of the bounded-width consistency algorithm in the context of the fixed-
template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that …

Let D, called the domain, be a fixed finite set and let Γ, called the valued constraint
language, be a fixed set of functions of the form f:D^m→Q∪{∞\}, where different functions …

A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued
constraint language, a fixed set of cost functions on a finite domain. An instance of the …

We provide a unified framework to study hierarchies of relaxations for Constraint Satisfaction
Problems and their Promise variant. The idea is to split the description of a hierarchy into an …

In the field of constraint satisfaction problems (CSPs), promise CSPs are an exciting new
direction of study. In a promise CSP, each constraint comes in two forms:“strict” and “weak,” …