Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations.
Exercises
Loading...
來自 Princeton University 的課程
Analytic Combinatorics
Princeton University
從本節課中
Singularity Analysis
This lecture addresses the basic Flajolet-Odlyzko theorem, where we find the domain of analyticity of the function near its dominant singularity, approximate using functions from standard scale, and then transfer to coefficient asymptotics term-by-term.
與講師見面
Robert SedgewickWilliam O. Baker *39 Professor of Computer Science
Computer Science
