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).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Erik D. Demaine is Professor of Computer Science at MIT and a MacArthur Fellow. His previous books include Geometric Folding Algorithms and Games, Puzzles, and Computation.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26405479584
Quantité disponible : 3 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. N° de réf. du vendeur 18405479594
Quantité disponible : 3 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur GB-9780262550772
Quantité disponible : 3 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. 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). Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780262550772
Quantité disponible : 1 disponible(s)
Vendeur : Speedyhen, Hertfordshire, Royaume-Uni
Etat : NEW. N° de réf. du vendeur NW9780262550772
Quantité disponible : 3 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 2026. hardcover. . . . . . N° de réf. du vendeur V9780262550772
Quantité disponible : 3 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. 2026. hardcover. . . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780262550772
Quantité disponible : 3 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 560 pages. 9.00x7.00x9.38 inches. In Stock. N° de réf. du vendeur __0262550776
Quantité disponible : 1 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. 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). Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780262550772
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Erik D. Demaine is Professor of Computer Science at MIT and a MacArthur Fellow. His previous books include Geometric Folding Algorithms and Games, Puzzles, and Computation.William Gasarch is Professor of Computer Science . N° de réf. du vendeur 2818005783
Quantité disponible : 1 disponible(s)