| Info hash | af6745de427de294a32cfee3ceae5b8aba909500 | ||
| Last mirror activity | 21d,10:03:54 ago | ||
| Size | 1.59GB (1,592,350,714 bytes) | ||
| Added | 2016-09-26 16:08:49 | ||
| Views | 1711 | ||
| Hits | 2425 | ||
| ID | 3442 | ||
| Type | multi | ||
| Downloaded | 2028 time(s) | ||
| Uploaded by |  joecohen | ||
| Folder | coursera-analytic-combinatorics | ||
| Num files | 56 files | ||
| File list [Hide list] |
| ||
| Mirrors | 5 complete, 0 downloading = 5 mirror(s) total [Log in to see full list] |
coursera-analytic-combinatorics (56 files)
Tags:
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.
Analytic Combinatorics is based on formal methods for deriving functional relationships on generating functions and asymptotic analysis treating those functions as functions in the complex plane. This course covers the symbolic method for defining generating functions immediately from combinatorial constructions, then develops methods for directly deriving asymptotic results from those generating functions, using complex asymptotics, singularity analysis, saddle-point asymptotics, and limit laws. The course teaches the precept "if you can specify it, you can analyze it".
Year: 2016
License: No license specified, the work may be protected by copyright.
Bibtex:
@article{,
title= {[Coursera] Analytic Combinatorics},
keywords= {},
journal= {},
author= {Robert Sedgewick (Princeton University)},
year= {2016},
url= {},
license= {},
abstract= {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.
Analytic Combinatorics is based on formal methods for deriving functional relationships on generating functions and asymptotic analysis treating those functions as functions in the complex plane. This course covers the symbolic method for defining generating functions immediately from combinatorial constructions, then develops methods for directly deriving asymptotic results from those generating functions, using complex asymptotics, singularity analysis, saddle-point asymptotics, and limit laws. The course teaches the precept "if you can specify it, you can analyze it".},
superseded= {},
terms= {}
}
