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.
Length: 8 Weeks
Effort: 6-8 hours per week
Provider: Princeton University via Coursera
Subject: Computer Science
Instructors: Robert Sedgewick