Search result for Combinatorial analysis Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 11 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
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. 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. Combinatorial Structures and OGFs Combinatorial Parameters and MGFs...
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....
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
These are examples of NP-hard combinatorial optimization problems. By taking this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques. Lecture: Analysis Lecture: analysis Lecture: large items analysis A reference on this stopping time analysis Lecture: analysis...
Introduction to Enumerative Combinatorics
by Evgeny Smirnov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 111 hours to complete
In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan numbers etc. However, some acquaintance with basic linear algebra and analysis (including Taylor series expansion) may be very helpful. Generating functions: a unified approach to combinatorial problems. “Quantum” versions of combinatorial identities...
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
By taking the two parts of this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques. Analysis Analysis Analysis...
Discrete Math and Analyzing Social Graphs
by Владимир Подольский , Ilya V. Schurov , Stepan Kuznetsov- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 20 hours to complete
Basics of this topic are critical for anyone working in Data Analysis or Computer Science. Probability is everywhere in Data Analysis and we will study it in much more details later. Finally, we will study the combinatorial structure that is the most relevant for Data Analysis, namely graphs. Generation of Combinatorial Objects...
计算几何 | 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....
$49
Related searches
Combinatorial Mathematics | 组合数学
by Yuchun Ma- 0.0
-
![]()
![]()
![]()
![]()
![]()
12 Weeks
Combinatorial mathematics is just the science to deal with combinations of discrete items. Today, combinatorial mathematics is regarded as the basis of computer science since the algorithms in programming heavily rely on the analysis of the discrete elements. Applying math to computer science and financial analysis...
$149
Learn VHDL Design using Xilinx Zynq-7000 ARM/FPGA SoC
by Clyde R. Visser, P.E.- 0.0
-
![]()
![]()
![]()
![]()
![]()
5 hours on-demand video
Teach yourself the analysis and synthesis of digital systems using VHDL to design and simulate FPGA, ASIC, and VLSI digital systems. You will learn finite state machine design, the two-process design methodology, test-bench design, combinatorial and sequential logic, and extensible synthesizable designs that are reusable....
$12.99
Discrete Mathematics
by Dominik Scheder- 3.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 42 hours to complete
Combinatorial Identities...
