麻省理工 算法设计与分析 (6.046J, Design and Analysis of Algorithms, 2015, Erik Demaine)【英】

1.6万
78
2018-10-30 13:01:17
238
114
1783
80
课程地址:https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/ 视频地址:https://www.youtube.com/playlist?list=PLUl4u3c
视频选集
(1/34)
自动连播
01#Course Overview, Interval Scheduling
01:23:35
02#Divide & Conquer - Convex Hull, Median Finding
01:20:35
02R1#Matrix Multiplication and the Master Theorem
53:46
03#Divide & Conquer - FFT
01:20:52
03R2-3#Trees and B -Trees
30:45
04#Divide & Conquer - van Emde Boas Trees
01:20:15
05#Amortization - Amortized Analysis
01:15:53
06#Randomization - Matrix Multiply, Quicksort
01:21:52
06R4#Randomized Select and Randomized Quicksort
39:30
07#Randomization - Skip Lists
01:20:56
08#Randomization - Universal & Perfect Hashing
01:21:51
08R5#Dynamic Programming
52:03
09#Augmentation - Range Trees
01:24:35
10#Dynamic Programming - Advanced DP
01:20:08
11#Dynamic Programming - All-Pairs Shortest Paths
01:21:49
12#Greedy Algorithms - Minimum Spanning Tree
01:22:10
12R6#Greedy Algorithms
22:24
13#Incremental Improvement - Max Flow, Min Cut
01:22:58
14#Incremental Improvement - Matching
01:22:33
14R7#Network Flow and Matching
51:12
15#Linear Programming - LP, reductions, Simplex
01:22:27
16#Complexity - P, NP, NP-completeness, Reductions
01:25:25
16R8#NP-Complete Problems
45:47
17#Complexity - Approximation Algorithms
01:21:08
18#Complexity - Fixed -Parameter Algorithms
01:17:43
18R9#Approximation Algorithms - Traveling Salesman Problem
31:59
19#Synchronous Distributed Algorithms - Symmetry -Breaking#Shortest -Paths Spann
01:17:34
20#Asynchronous Distributed Algorithms - Shortest -Paths Spanning Trees
01:12:03
20R10#Distributed Algorithms
50:19
21#Cryptography - Hash Functions
01:22:01
22#Cryptography - Encryption
01:24:15
23#Cache -Oblivious Algorithms - Medians & Matrices
01:20:28
23R11#Cryptography - More Primitives
49:30
24#Cache -Oblivious Algorithms - Searching & Sorting
01:17:41
客服
顶部
赛事库 课堂 2021拜年纪