Contact
How to shop
Delivery
Shopping guide
Computational Intractability
English
357 b
New
Up to 30 days for returns
Customers also purchased
/
Adobe ePub DRM
5 168
Ft
/
Paperback
19 365
Ft
/
Hardback
56 420
Ft
A practical guide to understanding the theory and practice of computational lower bounds.
A fundamental question in computer science is: “Given a problem, how hard is it to solve?” Usually, the answer to this question lies in determining how long it will take to solve a problem as a function of the length of the input. Yet this question has two different parts, with two different answers: (1) upper bounds, which show that a problem can be solved in time T(n), and (2) lower bounds, which show that a problem cannot be solved in time T(n). In Computational Intractability, Erik Demaine, William Gasarch, and Mohammad Hajiaghayi focus on the latter, providing a guidebook to navigating lower bounds via the study of P, NP, NP-completeness, and other related notions.
Computational Intractability covers virtually all aspects of lower bounds, from parallelism to undecidability, and explores this material from the point of view of actual problems rather than classes of problems. The authors show how to prove lower bounds on problems in a wide variety of settings: polynomial time, classes likely above polynomial time (e.g., polynomial space), and classes within polynomial time (e.g., quadratic time).
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
14 998
Ft
/
Hardback
54 355
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?