Bøger af Herbert S. Wilf

Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in: Combinatorics; Probability Theory; Statistics; Theory of Markov Chains; and Number Theory.

This introductory textbook focuses on the design and analysis of algorithms. The author uses a careful selection of topics to illustrate tools for algorithm analysis, including mathematical preliminaries; recursive algorithms; and the network flow problem.