The design and analysis of computer algorithms
- New Delhi. : Pearson, 2008.
- x, 470 p.; PAPER BACK 24 cm.
Computer Science
CONTENTS: 1. Models of computation 2. Design of efficient algorithms 3. Sorting and order statistics 4. Data structures for set manipulation problems 5. Algorithms on graphs 6. Matrix manipulation and related operations 7. The fast Fourier transform and its applications 8. Integer and polynomial arithmetic 9. Pattern-matching algorithms 10. MP-complete problems 11. Some provably intractable problems 12. Lower bounds on numbers of arithmetic operations