ABUSE FORM
Mathematics for the Analysis of Algorithms
Posted By :
nambkhn
|
Date :
11 Dec 2009 16:48:13
|
Comments :
0
|
|
Mathematics for the Analysis of Algorithms
By Daniel H. Greene, Donald E. Knuth
Publisher: Birkhäuser Boston; 3rd edition | 1990 | 132 Pages | ISBN: 0817635157 | PDF | 5.03 MB
By Daniel H. Greene, Donald E. Knuth
Publisher: Birkhäuser Boston; 3rd edition | 1990 | 132 Pages | ISBN: 0817635157 | PDF | 5.03 MB
| “ | 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. | ” |
| ADVERTISING » | High Speed Download | « ADVERTISING |
Recent searches:


No comments for the news