Manuel Bodirsky

Complexity of Infinite-Domain Constraint Satisfaction (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 10. Juni 2021
• Englisch
• ISBN-13: 9781009158633
• Artikelnr.: 66176938

Autorenporträt

Manuel Bodirsky is Professor at the Institute for Algebra in the Faculty of Mathematics at TU Dresden.

Inhaltsangabe

1. Introduction to constraint satisfaction problems
2. Model theory
3. Primitive positive interpretations
4. Countably categorical structures
5. Examples
6. Universal algebra
7. Equality constraint satisfaction problems
8. Datalog
9. Topology
10. Oligomorphic clones
11. Ramsey theory
12. Temporal constraint satisfaction problems
13. Non-dichotomies
14. Conclusion and outlook
References
Index.