<p>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 more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.</p>

Mathematics for the Analysis of Algorithms

Computers & Technology

Daniel H. Greene

Computer Science

Birkhäuser Boston

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 more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.

Mathematics for the analysis of algorithms (Progress in computer science and applied logic)

Donald E. Knuth

Programming

Birkhauser

See the best price to sell, buy, or rent books by Daniel H. Greene. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Daniel H. Greene