Opening book details…
Can I read Mathematics for the analysis of algorithms (Progress in computer science) on EtoBox?
Mathematics for the analysis of algorithms (Progress in computer science) by DANIEL H. GREENE, DONALD E. KNUTH,BIRKHAUSER is a nonfiction available to read on EtoBox.
What is Mathematics for the analysis of algorithms (Progress in computer science) 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.
Who reads Mathematics for the analysis of algorithms (Progress in computer science)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- DANIEL H. GREENE, DONALD E. KNUTH,BIRKHAUSER
- Publisher
- Birkhäuser
- Published
- 1981
- Language
- EN
- ISBN
- 9783764330460
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Programming
Other editions & translations
- Аэробные метилобактерии. (2010)
- Mathematics for the Analysis of Algorithms || (1990)
- Mathematics for the analysis of algorithms (Progress in computer science) (1986)
- Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics) (1990)
- Mathematics for the analysis of algorithms (Progress in computer science) (1982)
More by DANIEL H. GREENE, DONALD E. KNUTH,BIRKHAUSER
Browse all works by DANIEL H. GREENE, DONALD E. KNUTH,BIRKHAUSER
Similar books
- Analysis for Computer Scientists: Foundations, Methods, and Algorithms (Undergraduate Topics in Computer Science) — Michael Oberguggenberger, Alexander Ostermann (auth.) (2011)
- The Design and Analysis of Algorithms (Monographs in Computer Science) — Dexter C. Kozen. (2012)
- Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science) — Alistair Sinclair (auth.) (1993)
- Probabilistic Analysis Of Algorithms: On Computing Methodologies For Computer Algorithms Performance Evaluation (monographs In Computer Science) — Micha Hofri (auth.) (1987)
- Practical Analysis of Algorithms (Undergraduate Topics in Computer Science) — Dana Vrajitoru, William Knight (auth.) (2014)
- Essential Discrete Mathematics for Computer Science — Harry Lewis & Rachel Zax (2019)
