开始时间: 04/22/2022 持续时间: 5 weeks
所在平台: CourseraArchive 课程类别: 数学 大学或机构: Princeton University(普林斯顿大学) 授课老师: Robert Sedgewick |
课程主页: https://www.coursera.org/course/introACpartI
课程评论:没有评论
Analytic Combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. Part I of this course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. Part I covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.
Analytic Combinatorics, Part II 关注
Computational Methods for Data Analysis 关注
Network Analysis in Systems Biology 关注