Dasgupta, Sanjoy <br/><br/>
Algorithms 

 - Boston :  [S.n.],  c2008 
 - x, 320 p. : il. ;  24 cm. 
<br/><br/>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 
<br/><br/><label>ISBN: </label>9780073523408 
<br/><br/><label>Standard No.: </label>DIF-M3029 
<br/><br/><label>Subjects--Topical Terms: </label><br/>ALGORITMOS NUMÉRICOS<br/>ALGORITMOS<br/>GRAFOS