Algorithms

Dasgupta, Sanjoy; Papadimitriou, Christos; Vazirani, Umesh

ISBN 10: 0073523402 / ISBN 13: 9780073523408

Published by McGraw-Hill Education, 2006

About this Item

Good Reading Copy, May have minor shelf wear, Fast Shipping - Safe and Secure in Mailer.

Seller Inventory # 4Q2SPP001VZC

Bibliographic Details

• Title: Algorithms
• Publisher: McGraw-Hill Education
• Publication Date: 2006
• Language: English
• ISBN 10: 0073523402
• ISBN 13: 9780073523408
• Binding: Soft cover
• Condition: Good

About this title

Synopsis

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.

Synopsis

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. The 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. It includes 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. It gives an accessible treatment of linear programming and 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.