𝔖 Scriptorium
✦   LIBER   ✦

📁

Mathematics for the analysis of algorithms

✍ Scribed by Daniel H. Greene, Donald E. Knuth


Publisher
Birkhäuser
Year
1990
Tongue
English
Leaves
139
Series
Progress in computer science and applied logic 1
Edition
3rd ed
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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 Knuth's contribution.But I would suggest to you that the best use of the book is in tackling those problems. In the spirit of Knuth's classic Art of Computer Programming series, where he gives extensive questions and answers.I realise my suggestion may have appeal to only some of you. But I'm addressing my remarks to the smartest amongst you glancing at this. Test and improve your understanding of algorithms.

✦ Subjects


Информатика и вычислительная техника;Теория алгоритмов;


📜 SIMILAR VOLUMES


Mathematics for the Analysis of Algorith
✍ 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
✍ 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
✍ Daniel H Greene; Donald Ervin Knuth 📂 Library 📅 1982 🏛 Birkhäuser 🌐 English

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 mo

Mathematics for the Analysis of Algorith
✍ 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
✍ 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