Introduces the universal-algebraic approach to classifying the computational complexity of constraint satisfaction problems.

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems t

In this thesis we study the computational complexity of MinCSP - an optimization version of the Constraint Satisfaction Problem (CSP). The input to a MinCSP is

In this thesis we study the worst-case complexity ofconstraint satisfaction problems and some of its variants. We use methods from universal algebra: in particu