This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course 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.
Analyse de la complexité des algorithmesUniversité de Princeton
À propos de ce cours
Université de Princeton
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
- 5 stars75,92 %
- 4 stars12,34 %
- 3 stars5,55 %
- 2 stars2,46 %
- 1 star3,70 %
Meilleurs avis pour ANALYSE DE LA COMPLEXITÉ DES ALGORITHMES
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
Can I earn a certificate in this course?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.