Complexity of Infinite-Domain Constraint Satisfaction

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

Introduces the universal-algebraic approach to the complexity classification of constraint satisfaction problems in the finite and infinite-domain cases. Including background material from logic, topology, and combinatorics, it is suitable for graduate students and researchers in theoretical computer science and adjacent areas of mathematics.Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central questions in universal algebra. This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. It includes the required background from logic and combinatorics, particularly model theory and Ramsey theory, and explains the recently discovered link between Ramsey theory and topological dynamics and its implications for CSPs. The book will be of interest to graduate students and researchers in theoretical computer science and to mathematicians in logic, combinatorics, and dynamics who wish to learn about the applications of their work in complexity theory.