**You are here:**

# Mathematics for the Analysis of Algorithms

## byDaniel H. Greene, Donald E. Knuth

### Paperback | October 5, 2007

### Pricing and Purchase Info

^{®}points

Prices and offers may vary in store

### about

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.

### Details & Specs

The following ISBNs are associated with this title:

ISBN - 10:0817647287

ISBN - 13:9780817647285

Look for similar items by category:

### Customer Reviews of Mathematics for the Analysis of Algorithms

### Extra Content

Table of Contents

Editorial Reviews