Complexity of Infinite-Domain Constraint Satisfaction
Author:
- 28 May 2021
- book
- Published by Cambridge University Press (CUP)
Abstract
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.Keywords
This publication has 100 references indexed in Scilit:
- Causal graphs and structurally restricted planningJournal of Computer and System Sciences, 2010
- Constraint satisfaction with succinctly specified relationsJournal of Computer and System Sciences, 2010
- Universal algebra and hardness results for constraint satisfaction problemsTheoretical Computer Science, 2009
- Maximal infinite-valued constraint languagesTheoretical Computer Science, 2009
- H-Coloring dichotomy revisitedTheoretical Computer Science, 2005
- Negative Boolean constraintsTheoretical Computer Science, 1996
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Infinite permutation groups II. Subgroups of small indexJournal of Algebra, 1989
- Ramsey classes of set systemsJournal of Combinatorial Theory, Series A, 1983
- Transitivity of permutation groups on unordered setsMathematische Zeitschrift, 1976