INGLÉS EPUB con DRM eBook

Computational Intractability | eBook

A Guide to Algorithmic Lower Bounds

Por

ERIK D. DEMAINE

,

WILLIAM GASARCH

y

MOHAMMADTAGHI HAJIAGHAYI

(0)
Nuevo

Léelo en cualquier dispositivo Descárgalo y empieza a leer ya

Usa tu Bono Cultural en este producto.

Sinopsis

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

Explora los límites de la mente, la salud y el conocimiento

Ver más eBooks de Ciencias

Léelo en cualquier dispositivo


Ficha Técnica

Editorial: The Mit Press

ISBN: 9780262381147

Idioma: Inglés

Fecha de lanzamiento: 13/10/2026

Especificaciones del producto

Reseñas sobre Computational Intractability

Comparte tu experiencia con la comunidad lectora.

0

0 Reseñas

5 0
4 0
3 0
2 0
1 0

Sólo por opinar entras en el sorteo mensual de tres tarjetas regalo valoradas en
20€

Los eBooks más vendidos de la semana

Ver más