… COMPLEXITY OF CSP We begin this section by discussing the rather vague term “fine-grained
complexity” … approach based on partial polymorphisms can be used to study this question …

… Complexity Before we describe how partial polymorphisms can be used to study the fine-grained
complexity of … a related application, which preceded fine-grained complexity in time. To …

… COMPLEXITY OF CSP We begin this section by discussing the rather vague term “fine-grained
complexity” … approach based on partial polymorphisms can be used to study this question …

… study the constraint satisfaction problem (CSP) parameterized by a constraint language Γ
(CSP… pPol(Γ) for the set of partial polymorphisms of the constraint language Γ. Sets of the form …

… In this thesis we study the computational complexity of constraint satisfaction problems using
techniques from partial clone theory. The purpose of this introduction is to give an intuition …

… partial polymorphism of a constraint language Γ describes a rule to identify (or produce)
redundant constraints in CSP instances over … survey on the fine-grained complexity of constraint …

… The constraint satisfaction problem CSP(Γ) is the more … of the types of partial polymorphisms
enjoyed by sign-symmetric … between the partial polymorphisms we are led to study in this …

… for analysing the complexity of CSP problems— the polymorphism-… The constraint satisfaction
problem over Γ (CSP(Γ)) is … First, we study how to decompose the instances of CSP(D2) in …

… of fine-grained complexity of constraint satisfaction problems … mean the set of partial
polymorphisms of the edge relation EH… As a follow-up question we also study inclusions of the …

… fine-grained complexity of constraint satisfaction problems (CSPs) [9]. In a constraint satisfaction
problem (CSP), … structure of partial polymorphisms of graphs In this section we study the …