Methods in Algorithmic Analysis

ISBN-13: 9781138118041 / Angielski / Miękka / 2017 / 824 str.

Vladimir A. Dobrushkin

Opis

Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text presents numerous theories, techniques, and methods used for analyzing algorithms. It includes basic material on combinatorics and probability that can be used for students with weak backgrounds. It presents information on asymptotics not usually found in similar books, including Rice’s method, the Euler and Boole summation formulas, and recurrences. The author offers tutorials throughout the text on topics as diverse as continued fractions, functions of a complex variable, numerical calculations, and Stieltjes integration. An appendix contains a comprehensive collection of useful formulas.

Recenzje

…helpful to any mathematics student who wishes to acquire a background in classical probability and analysis … This is a remarkably beautiful book that would be a pleasure for a student to read, or for a teacher to make into a year's course.

—Harvey Cohn, Computing Reviews, May 2010

Spis treści

Preliminaries. Combinatorics. Probability. More about Probability. Recurrences or Difference Equations. Introduction to Generating Functions. Enumeration with Generating Functions. Further Enumeration Methods. Combinatorics of Strings. Introduction to Asymptotics. Asymptotics and Generating Functions. Review of Analytic Techniques. Appendices. Bibliography. Answers/Hints to Selected Problems. Index.

O autorze

Vladimir A. Dobrushkin is a professor in the Division of Applied Mathematics at Brown University and a professor in the Department of Computer Science at Worcester Polytechnic Institute.