Sanjoy Dasgupta <br/><br/>
Algorithms  

 - New Delhi  McGraw-Hill Higher Education   2008 
 - 	x, 320 p. : Illustration, Diagramme 
<br/><br/>	0 Prologue1 Algorithms with Numbers2 Divide-and-Conquer Algorithms3 Decompositions of Graphs4 Paths in Graphs5 Greedy algorithms6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping with NP-completeness10 Quantum Algorithms 
<br/><br/> 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.  
<br/><br/><label>ISBN: </label>9780070636613 
<br/><br/><label>Subjects--Topical Terms: </label><br/> 	      Algorithms -- Textbooks.     Computer algorithms -- Textbooks.     Algorithms 
<br/><br/><label>Dewey Class. No.: </label>518.1 DAS-A