|
Books > Computing & IT > Applications of computing > Artificial intelligence
|
Buy Now
Complexity of Infinite-Domain Constraint Satisfaction (Hardcover)
Loot Price: R3,919
Discovery Miles 39 190
|
|
|
Complexity of Infinite-Domain Constraint Satisfaction (Hardcover)
Series: Lecture Notes in Logic
Expected to ship within 12 - 19 working 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.
General
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!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
