Complexity of Infinite-Domain Constraint Satisfaction

By: Manuel Bodirsky

Write A Review

Hardcover | 10 June 2021

At a Glance

Hardcover
538 Pages

Dimensions(cm)
23.5 x 15.8 x 3.4

Hardcover

RRP $261.95

$227.75

13%OFF

or 4 interest-free payments of $56.94 with

or

Ships in 5 to 7 business days

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.

Industry Reviews

'... 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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.