Introduction to Algorithms, 3rd Edition (Mit Press). Este artículo no está disponible.
Cormen, Thomas H,Leiserson, Charles E,Rivest, Ronald L,Stein, Clifford
Idioma: inglés
Editorial: MIT Press, 2009
- Tapa dura
- Usado

Librería: Bellwetherbooks, McKeesport, PA, Estados Unidos de AmericaBellwetherbooks
Vendedor de IberLibro desde 17 de abril de 2007
Condición: Usado - Aceptable
EUR 8,90
Descripción del artículo del vendedor
Bruise/tear to cover.
N° de ref. del artículo mon0000018853
- Título
- Introduction to Algorithms, 3rd Edition (Mit Press)
- Autor
- Cormen, Thomas H,Leiserson, Charles E,Rivest, Ronald L,Stein, Clifford
- Editorial
- MIT Press
- Año de publicación
- 2009
- Estado
- Good
- Encuadernación
- hardcover
- Idioma
- inglés
- ISBN 10
- 0262033844
- ISBN 13
- 9780262033848
- Edición
- 3ª Edición
- Peso del artículo
- 4,87 libras
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
“Sinopsis” puede pertenecer a otra edición de este título.
Acerca del autor
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
“Acerca de” puede pertenecer a otra edición de este título.