Search result for Combinatorial structures Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 6 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Analysis of Algorithms
by Robert Sedgewick- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
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....
Analytic Combinatorics
by Robert Sedgewick- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. Combinatorial Structures and OGFs Combinatorial Structures and OGFs Labelled Structures and EGFs Labeled Structures and EGFs Combinatorial Parameters and MGFs Combinatorial Parameters and MGFs...
Advanced Algorithmics and Graph Theory with Python
by Vincent Gripon , Patrick Meyer , Nicolas Farrugia , Carlos Eduardo Rosar Kos Lassance- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
We’ll go over data-structures, basic and advanced algorithms for graph theory, complexity/accuracy trade-offs, and even combinatorial game theory....
$49
计算几何 | Computational Geometry
by Junhui Deng- 0.0
-
![]()
![]()
![]()
![]()
![]()
16 Weeks
Since then, this phrase has been used to refer to algorithmic study on discrete and combinatorial geometric structures and can also be regarded as the geometric version of Algorithm Design and Analysis. Essential geometric structures and algorithms such as polygon decompositions, Voronoi diagrams, Delaunay triangulations...
$49
Functional Programming Principles in Scala
by Martin Odersky- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 45 hours to complete
2 - Combinatorial Search and For-Expressions 3 - Combinatorial Search Example Design immutable data structures...
Functional Programming Principles in Scala
by Martin Odersky- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 41 hours to complete
2 - Combinatorial Search and For-Expressions 3 - Combinatorial Search Example Design immutable data structures...
