Mathematics for the Analysis of Algorithms Contributor(s): Greene, Daniel H. (Author), Knuth, Donald E. (Author) |
|
ISBN: 0817647287 ISBN-13: 9780817647285 Publisher: Birkhauser OUR PRICE: $66.49 Product Type: Paperback Published: October 2007 Annotation: 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.
|
Additional Information |
BISAC Categories: - Computers | Computer Science - Mathematics | Number Systems - Mathematics | Applied |
Dewey: 004.015 |
LCCN: 2007936766 |
Series: Modern Birkhäuser Classics |
Physical Information: 0.5" H x 6.1" W x 9" (0.50 lbs) 132 pages |
Descriptions, Reviews, Etc. |
Publisher Description: 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.
|