142,95 €
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
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).
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).
William Gasarch is Professor of Computer Science at the University of Maryland, where his research focuses on complexity theory, combinatorics, and Ramsey Theory. His previous books include Problems with a Point and Mathematical Muffin Morsels.
MohammadTaghi Hajiaghayi is Jack and Rita G. Minker Professor of Computer Science at the University of Maryland. He is a Guggenheim Fellow, ACM Fellow, IEEE Fellow, AAAS Fellow, EATCS Fellow, and Blavatnik Honoree.
0. Computational Complexity Crash Course
I. NP and Its Variants
1. NP-Hardness via SAT
2. NP-Hardness via Planar SAT
3. NP-Hardness via Circuit SAT
4. NP-Hardness via Hamiltonian Cycle
5. NP-Hardness via 3-Partition
6. Exponential Time Hypothesis
7. Parameterized Complexity
8. Basic Lower Bounds on Approximability via PCP and Gap Reductions
9. Inapproximability
10. Unique Games Conjecture
II. Above NP
11. Counting Problems
12. Existential Theory of the Reals
13. PSPACE-Hardness
14. Beyond PSPACE But Decidable
15. Undecidable Problems
16. Contraint Logic
III. Below NP
17. 3SUM Conjecture: A Method for Obtaining Quadratic Lower Bounds
18. APSP Conjecture: A Method for Obtaining Cubic Lower Bounds
19. Lower Bounds for Online Algorithms
20. Lower Bounds on Streaming Algorithms
21. Parallel Algorithms: The MPC and AMPC Models
22. Nash Equilibria and Polynomial Parity Arguments for Directed Graphs
23. Quantum Computing
Bibliography
Index
| Erscheinungsjahr: | 2026 |
|---|---|
| Fachbereich: | Programmiersprachen |
| Genre: | Importe, Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: | Einband - fest (Hardcover) |
| ISBN-13: | 9780262550772 |
| ISBN-10: | 0262550776 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: |
Demaine, Erik D.
Gasarch, William Gasarch |
| Hersteller: | MIT Press Ltd |
| Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
| Maße: | 235 x 181 x 29 mm |
| Von/Mit: | Erik D. Demaine (u. a.) |
| Erscheinungsdatum: | 20.10.2026 |
| Gewicht: | 1,012 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Aktuell nicht verfügbar
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Wochen
Aktuell nicht verfügbar