Mathematics for the Analysis of Algorithms

Mathematics for the Analysis of Algorithms
Автор
 
Год
 
Страниц
 
143
ISBN
 
ISBN10:0817635157
Издатель
 
Birkhäuser Boston

Описание:

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.

Похожие книги

Mathematics for the analysis of algorithmsMathematics for the analysis of algorithms
Автор: Daniel H Greene
Год: 1982
Computer Security HandbookComputer Security Handbook
Автор: SEYMOUR BOSWORTH, M.E. KABAY
Год: 2002