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

Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are s

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

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

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