Buch, Englisch, Band 52, 300 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 1015 g
Reihe: Lecture Notes in Logic
Buch, Englisch, Band 52, 300 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 1015 g
Reihe: Lecture Notes in Logic
ISBN: 978-1-107-04284-1
Verlag: Cambridge University Press
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.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
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.
