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.
Analysis of AlgorithmsUniversidad de Princeton
Acerca de este Curso
Universidad 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 stars73,91 %
- 4 stars14,67 %
- 3 stars5,43 %
- 2 stars2,17 %
- 1 star3,80 %
Principales reseñas sobre ANALYSIS OF ALGORITHMS
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
Excellent course, great exercise in combinatorics.
Such a good class as an intro to Analytic Combinatorics and Analysis of Algorithms
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
¿Cuándo podré acceder a las lecciones y tareas?
Can I earn a certificate in this course?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.