Mathematics for the Analysis of Algorithms Paperback / softback
by Daniel H. Greene, Donald E. Knuth
Paperback / softback
Description
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.
Information
-
Item not Available
- Format:Paperback / softback
- Pages:132 pages, VIII, 132 p.
- Publisher:Birkhauser Boston Inc
- Publication Date:05/10/2007
- Category:
- ISBN:9780817647285
Other Formats
- PDF from £46.74
Information
-
Item not Available
- Format:Paperback / softback
- Pages:132 pages, VIII, 132 p.
- Publisher:Birkhauser Boston Inc
- Publication Date:05/10/2007
- Category:
- ISBN:9780817647285