Limit search to available items
Book Cover
E-book
Author Bodirsky, Manuel, 1976- author.

Title Complexity of infinite-domain constraint satisfaction / Manuel Bodirsky
Published Cambridge, United Kingdom ; New York, NY : Cambridge University Press, 2021

Copies

Description 1 online resource
Series Lecture notes in logic ; 52
Lecture notes in logic ; 52.
Contents Introduction to constraint satisfaction problems -- Model theory -- Primitive positive interpretations -- Countably categorical structures -- Examples -- Universal algebra -- Equality constraint satisfaction problems -- Datalog -- Topology -- Oligomorphic clones -- Ramsey theory -- Temporal constraint satisfaction problems -- Non-dichotomies -- Conclusion and outlook
Summary "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 the applications of their work to complexity theory"-- Provided by publisher
Notes "A publication of the Association for Symbolic Logic."
Bibliography Includes bibliographical references and index
Notes Description based on print version record and CIP data provided by publisher; resource not viewed
Subject Constraint programming (Computer science)
Constraints (Artificial intelligence) -- Mathematics
Linear programming.
Computational complexity.
Programming, Linear
Computational complexity
Constraint programming (Computer science)
Linear programming
Form Electronic book
Author Association for Symbolic Logic, issuing body.
LC no. 2021010433
ISBN 9781107337534
1107337534