你好! Tracked shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

Take advantage of this pre-sale
portada Computational Intractability: A Guide to Algorithmic Lower Bounds
Type
Physical Book
Publisher
Author
Year
2026
Language
English
Pages
550
Format
Hardcover
Dimensions
22.86 x 17.78 cm
ISBN13
9780262550772

Computational Intractability: A Guide to Algorithmic Lower Bounds

Erik D. Demaine (Author) · MIT Press · Hardcover

Computational Intractability: A Guide to Algorithmic Lower Bounds - Erik D. Demaine

New Book Imported to Taiwan
Delivery: 21 Oct - 03 Nov Shipping: 48 to 52 business days.
NT$ 4,102
NT$ 4,102

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Computational Intractability: A Guide to Algorithmic Lower Bounds"

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 MohammadTaghi 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).

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews