Articoli correlati a Computational Intractability: A Guide to Algorithmic...
Sinossi
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).
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull'autore
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Computational Intractability: A Guide to Algorithmic...
Foto dell'editore
Computational Intractability: A Guide to Algorithmic Lower Bounds
Da: Books Puddle, Woodside, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 26405479584
Compra nuovo
EUR 96,46
Spedizione EUR 3,56
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 3 disponibili
Foto dell'editore
Computational Intractability: A Guide to Algorithmic Lower Bounds
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 18405479594
Compra nuovo
EUR 111,29
Spedizione EUR 9,95
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 3 disponibili
Foto dell'editore
Computational Intractability
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo GB-9780262550772
Compra nuovo
EUR 118,75
Spedizione EUR 5,99
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computational Intractability (Hardcover)
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780262550772
Compra nuovo
EUR 130,54
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
COMPUTATIONAL INTRACTABILITY
Da: Speedyhen, Hertfordshire, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: NEW. Codice articolo NW9780262550772
Compra nuovo
EUR 101,54
Spedizione EUR 48,95
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computational Intractability: A Guide to Algorithmic Lower Bounds
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2026. hardcover. . . . . . Codice articolo V9780262550772
Compra nuovo
EUR 157,69
Spedizione EUR 9,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Computational Intractability: A Guide to Algorithmic Lower Bounds
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2026. hardcover. . . . . . Books ship from the US and Ireland. Codice articolo V9780262550772
Compra nuovo
EUR 165,31
Spedizione EUR 9,37
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Computational Intractability (Hardcover)
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780262550772
Compra nuovo
EUR 141,42
Spedizione EUR 44,18
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Intractability : A Guide to Algorithmic Lower Bounds
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware - 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). Codice articolo 9780262550772
Compra nuovo
EUR 152,19
Spedizione EUR 35,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computational Intractability (Hardcover)
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9780262550772
Compra nuovo
EUR 203,45
Spedizione EUR 33,03
Spedito da Australia a U.S.A.
Spedito da Australia a U.S.A.
Quantità: 1 disponibili