Compartir
A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (en Inglés)
Yves Robert
(Autor)
·
Fréderic Vivien
(Autor)
·
Anne Benoit
(Autor)
·
CRC Press
· Tapa Dura
A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (en Inglés) - Benoit, Anne ; Robert, Yves ; Vivien, Frédéric
$ 103.300
$ 187.810
Ahorras: $ 84.510
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Reino Unido
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Martes 25 de Junio y el
Viernes 05 de Julio.
Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.
Reseña del libro "A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (en Inglés)"
Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis provides a roadmap for readers to determine the difficulty of an algorithmic problem by finding an optimal solution or proving complexity results. It gives a practical treatment of algorithmic complexity and guides readers in solving algorithmic problems.Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem. Part I helps readers understand the main design principles and design efficient algorithms. Part II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness. Part III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard. Drawing on the authors' classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.
