MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02453nam a22003617a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
IIITD |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250609152707.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250603b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9789355325525 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
IIITD |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| Item number |
DAS-A |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Dasgupta, Sanjoy |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Algorithms |
| Statement of responsibility, etc |
by Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
New Delhi : |
| Name of publisher, distributor, etc |
McGraw-Hill, |
| Date of publication, distribution, etc |
©2008 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
x, 320 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references (pages 317-318) and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
1. Algorithms with numbers |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
2. Divide-and-conquer algorithms |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
3. Decompositions of graphs |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
4. Paths in graphs |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
5. Greedy algorithms |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
6. Dynamic programming |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
7. Linear programming and reductions |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
8. NP-complete problems |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
9. Coping with NP-completeness |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
10. Quantum algorithms |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Papadimitriou, Christos |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Vazirani, Umesh |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Books |
| Source of classification or shelving scheme |
Dewey Decimal Classification |
