000			02453nam a22003617a 4500
003			IIITD
005			20250609152707.0
008			250603b |||||||| |||| 00| 0 eng d
020			_a9789355325525
040			_aIIITD
082			_a005.1 _bDAS-A
100			_aDasgupta, Sanjoy
245			_aAlgorithms _cby Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
260			_aNew Delhi : _bMcGraw-Hill, _c©2008
300			_ax, 320 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (pages 317-318) and index.
505			_t1. Algorithms with numbers
505			_t2. Divide-and-conquer algorithms
505			_t3. Decompositions of graphs
505			_t4. Paths in graphs
505			_t5. Greedy algorithms
505			_t6. Dynamic programming
505			_t7. Linear programming and reductions
505			_t8. NP-complete problems
505			_t9. Coping with NP-completeness
505			_t10. Quantum algorithms
520			_aThis 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.
650			_aComputer programming
650			_aAlgorithms
700			_aPapadimitriou, Christos
700			_aVazirani, Umesh
942			_cBK _2ddc
999			_c190018 _d190018