Share
Complexity of Infinite-Domain Constraint Satisfaction: 52 (Lecture Notes in Logic, Series Number 52) (in English)
Manuel Bodirsky (Author)
·
Cambridge University Press
· Hardcover
Complexity of Infinite-Domain Constraint Satisfaction: 52 (Lecture Notes in Logic, Series Number 52) (in English) - Manuel Bodirsky
$ 145.83
$ 162.99
You save: $ 17.16
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Monday, June 03 and
Tuesday, June 04.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Complexity of Infinite-Domain Constraint Satisfaction: 52 (Lecture Notes in Logic, Series Number 52) (in English)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.
✓ Producto agregado correctamente al carro, Ir a Pagar.
