Complexity of Infinite-Domain Constraint Satisfaction (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Lecture Notes in Logic
Release date:	June 2021
Authors:	Manuel Bodirsky
Dimensions:	235 x 158 x 34mm (L x W x T)
Format:	Hardcover
Pages:	300
ISBN-13:	978-1-107-04284-1
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	1-107-04284-4
Barcode:	9781107042841

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!