Algorithms

Sanjoy Dasgupta

ISBN 10: 0073523402 / ISBN 13: 9780073523408

Edité par McGraw-Hill Education - Europe, 2006

A propos de cet article

2006. 1st Edition. Paperback. Explaining the fundamentals of algorithms, this text emphasizes on understanding the mathematical idea behind each algorithm. It includes features such as: the use of boxes to strengthen the narrative: pieces that give historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Num Pages: 336 pages, illustrations. BIC Classification: UK. Category: (U) Tertiary Education (US: College). Dimension: 230 x 186 x 14. Weight in Grams: 508. . . . . .

N° de réf. du vendeur V9780073523408

Détails bibliographiques

• Titre: Algorithms
• Éditeur: McGraw-Hill Education - Europe
• Date de parution: 2006
• Langue: anglais
• ISBN à 10 chiffres: 0073523402
• ISBN à 13 chiffres: 9780073523408
• Reliure: Couverture souple
• Édition: Edition originale
• État de l'article: New

A propos de ce titre

Synopsis

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.

"Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University

Présentation de l'éditeur

This text 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. "Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.