This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.The book is very well written. The style and the mathematical exposition make the book pleasant to read.
|Title||:||Mathematics for the Analysis of Algorithms|
|Author||:||Daniel H. Greene, Donald E. Knuth|
|Publisher||:||Springer Science & Business Media - 1990-09-01|