Computational Intractability

<b>A practical guide to understanding the theory and practice of computational lower bounds.</b><br><br>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 <i>can</i> be solved in time <i>T</i>(<i>n</i>), and (2) lower bounds, which show that a problem <i>cannot</i> be solved in time <i>T</i>(<i>n</i>). In <i>Computational Intractability</i>, 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.<br><br><i>Computational Intractability</i> 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).