Complexity of Infinite-Domain Constraint Satisfaction

AvManuel Bodirsky

Inbunden, Engelska, 2021

Del 52 i serien Lecture Notes in Logic

1 877 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

2 178 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2021-06-10
Mått:158 x 235 x 34 mm
Vikt:950 g
Format:Inbunden
Språk:Engelska
Serie:Lecture Notes in Logic
Antal sidor:538
Förlag:Cambridge University Press
ISBN:9781107042841

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik

Mer om författaren

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

Recensioner i media

'… this book is essential reading for anyone with the vaguest interest in computational complexity, as well as for those curious about potential applications of model theory and universal algebra. It brings together decades of intense research by different research communities in a uniform format.' Victor Lagerkvist, MathSciNet

Innehållsförteckning

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.