Titel: Mathematics for the Analysis of Algorithms
Autoren/Herausgeber: Daniel H. Greene, Donald E. Knuth
Aus der Reihe: Modern Birkhäuser Classics
Ausgabe: 3., Reprint of the 1990 ed.
Format: 23,5 x 15,5 cm
Gewicht: 470 g
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. 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.