Complexity of Infinite-Domain Constraint Satisfaction by Manuel Bodirsky
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.-
Effective Mathematics of the Uncountable
-
Set Theory, Arithmetic, and Foundations of Mathematics
-
Abstract Recursion and Intrinsic Complexity
-
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
-
Games, Scales and Suslin Cardinals
-
Large Cardinals, Determinacy and Other Topics
-
Logic Colloquium 2007
-
Lectures on Infinitary Model Theory
-
Logic and Algebraic Structures in Quantum Computing
-
Ordinal Definability and Recursion Theory
-
Logic Colloquium 2005
-
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 2, 3-Multi-graphs and 2-Multi-tournaments
-
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 1, Ordered Graphs and Distanced Graphs
-
Stable Domination and Independence in Algebraically Closed Valued Fields
-
A Comparison Process for Mouse Pairs
-
Recursion Theory
-
Descriptive Set Theory and Forcing
-
A General Algebraic Semantics for Sentential Logics
-
Bounded Variable Logics and Counting
-
Model Theory of Fields
-
Aspects of Incompleteness
-
Logic Colloquium '95
-
Logic Colloquium '90
-
Fine Structure and Iteration Trees
-
Logic Colloquium '96
-
The Core Model Iterability Problem
-
Quantifiers, Propositions and Identity
-
A Framework for Priority Arguments
-
Kurt Godel
-
A Guide to NIP Theories
-
The Cabal Seminar 4 Volume Hardback Set
-
The Largest Suslin Axiom
-
A Course in Model Theory
-
Simple Theories and Hyperimaginaries
-
Wadge Degrees and Projective Ordinals
' 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 algebraIt brings together decades of intense research by different research communities in a uniform format.' Victor Lagerkvist, MathSciNet
Manuel Bodirsky is Professor at the Institute for Algebra in the Faculty of Mathematics at TU Dresden.
| SKU | Unavailable |
| ISBN 13 | 9781107042841 |
| ISBN 10 | 1107042844 |
| Title | Complexity of Infinite-Domain Constraint Satisfaction |
| Author | Manuel Bodirsky |
| Series | Lecture Notes In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2021-06-10 |
| Number of pages | 300 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |