Items related to Math for the Analysis of Algorithms, Second Edition
Synopsis
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.
"synopsis" may belong to another edition of this title.
- PublisherBirkhauser Boston
- Publication date1986
- ISBN 10 081763102X
- ISBN 13 9780817631024
- BindingHardcover
- LanguageEnglish
- Edition number2
- Rating
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
