TY  - BOOK
AU  - Levitin,Anany
TI  - Introduction to the design and analysis of algorithms
SN  - 0201743957 (hbk.)
U1  - 005.1 
PY  - 2003///
CY  - Boston, Mass.
PB  - Addison Wesley
KW  - Computer algorithms
N1  - Includes bibliographical references (p. 431-438) and index; Preface.  - 1.  Introduction.  - 2.  Fundamentals of the analysis of algorithm efficiency.  - 3.  Brute force.  - 4.  Divide-and-conquer.  - 5.  Decrease-and-conquer.  - 6.  Transform-and-conquer.  - 7.  Space and time tradeoffs.  - 8.  Dynamic programming.  - 9.  Greedy technique.  - 10.  Limitations of algorithms power.  - 11.  Coping with the limitations of algorithm power epilogue.  - Appendix A.  Useful formulas for the analysis of algorithms.  - Appendix B.  Short tutorial on recurrence relations.  - Bibliography.  - Hints to exercises.  - Index
ER  -