|
|
|
|
|
|
|
HELP | |
|
  $44.75
TRADE PAPER, NEW
Ships in 1 to 3 days
 available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN:Algorithmsby Sanjoy Dasgupta
Synopses & ReviewsPublisher Comments: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 Synopsis:Papadimitrio is a one term algorithms text that takes an integrated approach and is priced well below any of the competitors within the market at $30.00.This product will take a more frequent revision cycle and will be the most current and up-to-date algorithms text in the marketplace.Manuscript is posted to authors site. Link is listed belowhttp://www.cs.ucsd.edu/~dasgupta/mcgrawhill
Table of Contents0 Prologue2 Divide-and-Conquer Algorithms4 Paths in Graphs6 Dynamic Programming8 NP-complete Problems10 Quantum Algorithms | ||||||||||||
|
| |||||||||||||
|
|||||||||||||
Don't Miss
