Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computational Intractability: A Guide to Algorithmic Lower Bounds

Computational Intractability: A Guide to Algorithmic Lower Bounds

Demaine, Erik D.
Gasarch, William
Hajiaghayi, Mohammad T.

Hardcover

General ComputersGeneral MathematicsProgramming

PREORDER - Expected ship date October 20, 2026

ISBN10: 0262550776
ISBN13: 9780262550772
Publisher: MIT Press
Published: Oct 20 2026
Pages: 550
Language: English
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).

Also from

Demaine, Erik D.

View All

Also in

General Mathematics

View All