Download or read book Mathematics for the Analysis of Algorithms written by Daniel H. Greene and published by Springer Science & Business Media. This book was released on 2009-05-21 with total page 141 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph, derived from an advanced computer science course at Stanford University, 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 terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.