Cantitate/Preț
Produs

Algorithms

Autor Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
en Limba Engleză Paperback – 16 oct 2006
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
Citește tot Restrânge

Preț: 34972 lei

Preț vechi: 43716 lei
-20% Nou

Puncte Express: 525

Preț estimativ în valută:
6693 6952$ 5559£

Carte disponibilă

Livrare economică 14-28 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780073523408
ISBN-10: 0073523402
Pagini: 336
Ilustrații: illustrations
Dimensiuni: 185 x 234 x 13 mm
Greutate: 0.5 kg
Editura: McGraw Hill Education
Colecția McGraw-Hill
Locul publicării:United States

Cuprins

0 Prologue

1 Algorithms with Numbers

2 Divide-and-Conquer Algorithms

3 Decompositions of Graphs

4 Paths in Graphs

5 Greedy algorithms

6 Dynamic Programming

7 Linear Programming and Reductions

8 NP-complete Problems

9 Coping with NP-completeness

10 Quantum Algorithms