Algorithms [ Livre] / Sanjoy, Dasgupta / Christos H., Papadimitriou

Auteur principal: Dasgupta, SanjoyCo-auteur: Papadimitriou, Christos H.;Vazirani, Umesh VirkumarLangue: Anglais ; de l'oeuvre originale, Anglais.Publication : New York (N.Y.) : McGraw-Hill Higher Education, 2008Description : 1 vol. (x-320 p.) ; 24 cmISBN: 9780073523408; 0073523402.Classification: F 2 Analyse des algorithmes et complexitéRésumé: This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. .Sujet - Nom commun: Algorithmes | Complexité de calcul (informatique) Ressources en ligne:Cliquez ici pour consulter en ligne
Current location Call number Status Notes Date due Barcode
ENS Rennes - Bibliothèque
Informatique
F 2 DAS (Browse shelf) Available F 2 Analyse des algorithmes et complexité 040306
ENS Rennes - Bibliothèque
Informatique
F 2 DAS (Browse shelf) Available F 2 Analyse des algorithmes et complexité 040307
ENS Rennes - Bibliothèque
Informatique
F 2 DAS (Browse shelf) Checked out F 2 Analyse des algorithmes et complexité 06/12/2018 019228
ENS Rennes - Bibliothèque
Informatique
F 2 DAS (Browse shelf) Exclu du prêt F 2 Analyse des algorithmes et complexité 019229
ENS Rennes - Bibliothèque
Informatique
F 2 DAS (Browse shelf) Checked out F 2 Analyse des algorithmes et complexité 03/06/2019 016199

Bibliogr. p. 317-318. Index

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.

Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.

Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.

An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.

Powered by Koha