Computational Intractability: A Guide to Algorithmic Lower Bounds
by Erik D. Demaine, William Gasarch and Mohammad T. Hajiaghayi
From $120.00 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $117.50 at 100+
Total $3,000.00
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
PDF quotes, purchase orders, tax exemption and help with vendor setup.
For schools Make it yoursBookplates, tipped-in pages, belly bands or author signatures. Subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment optionsComputational Intractability
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).
Details
- Publisher
- MIT Press
- Authors
- Erik D. Demaine, William Gasarch, Mohammad T. Hajiaghayi
- Format
- Hardcover
- Published
- Oct 20, 2026
- ISBN-13
- 9780262550772
- ISBN-10
- 0262550776
- Pages
- 550
- Carton quantity
- 10 copies
Computational Intractability for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $120.00 | 4% off list |
| 50 – 99 | $118.75 | 5% off list |
| 100+ | $117.50 | 6% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
Where can I buy 100 copies of Computational Intractability?
BookPal sells Computational Intractability in quantity. At 100 copies the price is $117.50 a copy, against a list price of $125.00, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Computational Intractability cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $120.00 (4% off list); 50 to 99 copies, $118.75 (5% off list); 100+ copies, $117.50 (6% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Computational Intractability?
Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Computational Intractability: A Guide to Algorithmic Lower Bounds
Groups also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.