𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Mathematics for the analysis of algorithms

✍ Scribed by Daniel H Greene; Donald Ervin Knuth

Publisher
Birkhäuser
Year
1982
Tongue
English
Leaves
123
Series
Progress in computer science, no. 1
Edition
2nd ed
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It 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 concise enough for easy reference yet detailed enough for those with little background with the material

πŸ“œ SIMILAR VOLUMES

Mathematics for the Analysis of Algorith
πŸ“ Mathematics for the Analysis of Algorithms
✍ Daniel H. Greene, Donald E. Knuth πŸ“‚ Library πŸ“… 1990 πŸ› BirkhΓ€user Boston 🌐 English

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 t

Mathematics for the analysis of algorith
πŸ“ Mathematics for the analysis of algorithms
✍ Daniel H Greene πŸ“‚ Library πŸ“… 1981 πŸ› Birkhauser 🌐 English

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 t

Mathematics for the Analysis of Algorith
πŸ“ Mathematics for the Analysis of Algorithms
✍ Daniel H. Greene, Donald E. Knuth (auth.) πŸ“‚ Library πŸ“… 1990 πŸ› BirkhΓ€user Basel 🌐 English

<p><P>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 vari

Mathematics for the analysis of algorith
πŸ“ Mathematics for the analysis of algorithms
✍ Daniel H Greene πŸ“‚ Library πŸ“… 1986 πŸ› Birkauser 🌐 English

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 t

Mathematics for the analysis of algorith
πŸ“ Mathematics for the analysis of algorithms
✍ Daniel H. Greene, Donald E. Knuth πŸ“‚ Library πŸ“… 1990 πŸ› BirkhΓ€user 🌐 English

This book is a gem of problem sets AND solutions, in the field of algorithms. The problems were from actual examinations given at Stanford in various computer science classes. About half the book is good descriptive text about the ideas that the problems probe. Certainly, well written, as befits Knu