Algorithms / Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani.
Material type:
TextPublisher: Boston : McGraw-Hill Higher Education, c2008Description: x, 320 p. : ill. ; 24 cmISBN: 9780073523408 (acid-free paper); 0073523402 (acid-free paper)Subject(s): Algorithms -- Textbooks | Computer algorithms -- TextbooksDDC classification: 518/.1 LOC classification: QA9.58 | .D37 2008Online resources: Table of contents only | Publisher description Table of contents also issued online.| Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Female Library | QA9.58 .D37 2008 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000097952 | |
|
Books
|
Main Library | QA9.58 .D37 2008 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000126720 |
Browsing Female Library shelves Close shelf browser
|
|
|
|
|
|
|
||
| QA9 .D863 2007 Transition to higher mathematics : structure and proof / | QA9 .D863 2007 Transition to higher mathematics : structure and proof / | QA9 .S755 2015 The foundations of mathematics / | QA9.58 .D37 2008 Algorithms / | QA9.6 .R63 2006 Thinking recursively with Java / | QA93 .F54 2014 50 visions of mathematics / | QA93 .P76 2005 Math for the anxious : building basic skills / |
Includes bibliographical references (p. 317-318) and index.
Prologue -- Algorithms with numbers -- Divide-and conquer algorithms -- Decompositions of graphs -- Paths in graphs -- Greedy algorithms -- Dynamic programming -- Linear programming and reductions -- NP-complete problems -- Coping with NP-completeness -- Quantum algorithms.
Table of contents also issued online.
1 2
There are no comments on this title.