学堂在线 × 王振波 - 高级算法设计与复杂度分析
├─{1}--1 Introduction of Algorithm
│├─{1}--1.1 Introduction
││ --Introduction.mp4
││ --Introduction.srt
││
│├─{2}--1.2 A First Problem Stable Match
││ --A First Problem Stable Matching.mp4
││ --A First Problem Stable Matching.srt
││
│├─{3}--1.3 Gale-Shapley Algorithm
││ --Gale-Shapley Algorith.mp4
││ --Gale-Shapley Algorith.srt
││
│├─{4}--1.4 Understanding Gale-Shapley A
││ --Understanding Gale-Shapley Algor.mp4
││ --Understanding Gale-Shapley Algor.srt
││
│└─{5}--Lecture note 1
│ #1.5.1#--Lecture note 1 Introduction of A.pdf
│ (1.5.1)--00introduction.ppt
│ (1.5.2)--01stable-matching.ppt
│
├─{2}--2 Basics of Algorithm Analysis
│├─{1}--2.1 Computational Tractability
││ --Computational Tractability.mp4
││ --Computational Tractability.srt
││
│├─{2}--2.2 Asymptotic Order of Growth
││ --Asymptotic Order of Growth.mp4
││ --Asymptotic Order of Growth.srt
││
│├─{3}--2.3 A Survey of Common Running T
││ --A Survey of Common Running Times.mp4
││ --A Survey of Common Running Times.srt
││
│└─{4}--Lecture note 2
│ #2.4.1#--Lecture note 2 Basics of Algorit.pdf
│ (2.4.1)--02analysis.ppt
│
├─{3}--3 Graph
│├─{1}--3.1 Basic Definitions and Applic
││ --Basic Definitions and Applicatio.mp4
││ --Basic Definitions and Applicatio.srt
││
│├─{2}--3.2 Graph Traversal
││ --Graph Traversal.mp4
││ --Graph Traversal.srt
││
│├─{3}--3.3 Testing Bipartiteness
││ --Testing Bipartiteness.mp4
││ --Testing Bipartiteness.srt
││
│├─{4}--3.4 Connectivity in Directed Gra
││ --Connectivity in Directed Graphs.mp4
││ --Connectivity in Directed Graphs.srt
││
│├─{5}--3.5 DAG and Topological Ordering
││ --DAG and Topological Ordering.mp4
││ --DAG and Topological Ordering.srt
││
│└─{6}--Lecture note 3
│ #3.6.1#--Lecture note 3 Graph.pdf
│ (3.6.1)--03graphs.ppt
│
├─{4}--4 Greedy Algorithms
│├─{10}--Lecture note 4
││ #4.10.1#--Lecture note 4 Greedy Algorithms.pdf
││ (4.10.1)--04greed.ppt
││ (4.10.2)--04ms.ppt
││
│├─{1}--4.1 Coin Changing
││ --Coin Changing.mp4
││ --Coin Changing.srt
││
│├─{2}--4.2 Interval Scheduling
││ --Interval Scheduling.mp4
││ --Interval Scheduling.srt
││
│├─{3}--4.3 Interval Partitioning
││ --Interval Partitioning.mp4
││ --Interval Partitioning.srt
││
│├─{4}--4.4 Scheduling to Minimize Laten
││ --Scheduling to Minimize Lateness.mp4
││ --Scheduling to Minimize Lateness.srt
││
│├─{5}--4.5 Optimal Caching
││ --Optimal Caching.mp4
││ --Optimal Caching.srt
││
│├─{6}--4.6 Shortest Paths in a Graph
││ --Shortest Paths in a Graph.mp4
││ --Shortest Paths in a Graph.srt
││
│├─{7}--4.7 Minimum Spanning Tree
││ --Minimum Spanning Tree.mp4
││ --Minimum Spanning Tree.srt
││
│├─{8}--4.8 Correctness of Algorithms
││ --Correctness of Algorithms.mp4
││ --Correctness of Algorithms.srt
││
│└─{9}--4.9 Clustering
│ --Clustering.mp4
│ --Clustering.srt
│
├─{5}--5 Divide and Conquer
│├─{1}--5.1 Mergesort
││ --Mergesort.mp4
││ --Mergesort.srt
││
│├─{2}--5.2 Counting Inversions
││ --Counting Inversions.mp4
││ --Counting Inversions.srt
││
│├─{3}--5.3 Closest Pair of Points
││ --Closest Pair of Points.mp4
││ --Closest Pair of Points.srt
││
│├─{4}--5.4 Integer Multiplication
││ --Integer Multiplication.mp4
││ --Integer Multiplication.srt
││
│├─{5}--5.5 Matrix Multiplication
││ --5.5 Matrix Multiplication.mp4
││ --5.5 Matrix Multiplication.srt
││
│├─{6}--5.6 Convolution and FFT
││ --Convolution and FFT.mp4
││ --Convolution and FFT.srt
││
│├─{7}--5.7 FFT
││ --FFT.mp4
││ --FFT.srt
││
│├─{8}--5.8 Inverse DFT
││ --Inverse DFT.mp4
││ --Inverse DFT.srt
││
│└─{9}--Lecture note 5
│ #5.9.1#--Lecture note 5 Divide and Conque.pdf
│ (5.9.1)--05divide-and-conquer.ppt
│ (5.9.2)--05ff.ppt
│
├─{6}--6 Dynamic Programming
│├─{1}--6.1 Weighted Interval Scheduling
││ --Weighted Interval Scheduling.mp4
││ --Weighted Interval Scheduling.srt
││
│├─{2}--6.2 Segmented Least Squares
││ --Segmented Least Squares.mp4
││ --Segmented Least Squares.srt
││
│├─{3}--6.3 Knapsack Problem
││ --Knapsack Proble.mp4
││ --Knapsack Proble.srt
││
│├─{4}--6.4 RNA Secondary Structure
││ --RNA Secondary Structure.mp4
││ --RNA Secondary Structure.srt
││
│├─{5}--6.5 Sequence Alignment
││ --Sequence Alignment.mp4
││ --Sequence Alignment.srt
││
│├─{6}--6.6 Shortest Paths
││ --Shortest Paths.mp4
││ --Shortest Paths.srt
││
│└─{7}--Lecture note 6
│ #6.7.1#--Lecture note 6 Dynamic Programmi.pdf
│ (6.7.1)--06dynamic-programming.ppt
│
├─{7}--7 Network Flow
│├─{1}--7.1 Flows and Cuts
││ --Flows and Cuts.mp4
││ --Flows and Cuts.srt
││
│├─{2}--7.2 Minimum Cut and Maximum Flow
││ --Minimum Cut and Maximum Flow.mp4
││ --Minimum Cut and Maximum Flow.srt
││
│├─{3}--7.3 Ford-Fulkerson Algorithm
││ --Ford-Fulkerson Algorith.mp4
││ --Ford-Fulkerson Algorith.srt
││
│├─{4}--7.4 Choosing Good Augmenting Pat
││ --Choosing Good Augmenting Paths.mp4
││ --Choosing Good Augmenting Paths.srt
││
│├─{5}--7.5 Bipartite Matching
││ --Bipartite Matching.mp4
││ --Bipartite Matching.srt
││
│└─{6}--Lecture note 7
│ #7.6.1#--Lecture note 7 Network Flow.pdf
│ (7.6.1)--07networkflow.ppt
│
├─{8}--8 NP and Computational Intractab
│├─{10}--Lecture note 8
││ #8.10.1#--Lecture note 8 NP and Computatio.pdf
││ (8.10.1)--08np-complete.pdf
││ (8.10.2)--08intractability.ppt
││
│├─{1}--8.1 Polynomial-Time Reductions
││ --Polynomial-Time Reductions.mp4
││ --Polynomial-Time Reductions.srt
││
│├─{2}--8.2 Basic Reduction Strategies I
││ --Basic Reduction Strategies I.mp4
││ --Basic Reduction Strategies I.srt
││
│├─{3}--8.3 Basic Reduction Strategies I
││ --Basic Reduction Strategies II.mp4
││ --Basic Reduction Strategies II.srt
││
│├─{4}--8.4 Definition of NP
││ --Definition of NP.mp4
││ --Definition of NP.srt
││
│├─{5}--8.5 Problems in NP
││ --Problems in NP.mp4
││ --Problems in NP.srt
││
│├─{6}--8.6 NP-Completeness
││ --NP-Completeness.mp4
││ --NP-Completeness.srt
││
│├─{7}--8.7 Sequencing Problems
││ --Sequencing Problems.mp4
││ --Sequencing Problems.srt
││
│├─{8}--8.8 Numerical Problems
││ --Numerical Problems.mp4
││ --Numerical Problems.srt
││
│└─{9}--8.9 co-NP and the Asymmetry of N
│ --co-NP and the Asymmetry of NP.mp4
│ --co-NP and the Asymmetry of NP.srt
│
├─{9}--9 Approximation Algorithms
│ ├─{1}--9.1 Load Balancing
│ │ --Load Balancing.mp4
│ │ --Load Balancing.srt
│ │
│ ├─{2}--9.2 Center Selection
│ │ --Center Selection.mp4
│ │ --Center Selection.srt
│ │
│ ├─{3}--9.3 The Pricing Method Vertex Co
│ │ --The Pricing Method Vertex Cover.mp4
│ │ --The Pricing Method Vertex Cover.srt
│ │
│ ├─{4}--9.4 LP Rounding Vertex Cover
│ │ --LP Rounding Vertex Cover.mp4
│ │ --LP Rounding Vertex Cover.srt
│ │
│ ├─{5}--9.5 Knapsack Problem
│ │ --Knapsack Proble.mp4
│ │ --Knapsack Proble.srt
│ │
│ └─{6}--Lecture note 9
│ #9.6.1#--Lecture note 9 Approximation Alg.pdf
│ (9.6.1)--09approx-alg.ppt
│
├─{10}--10 Local Search
│├─{1}--10.1 Landscape of an Optimizatio
││ --Landscape of an Optimization Pro.mp4
││ --Landscape of an Optimization Pro.srt
││
│├─{2}--10.2 Maximum Cut
││ --Maximum Cut.mp4
││ --Maximum Cut.srt
││
│├─{3}--10.3 Nash Equilibria
││ --Nash Equilibria.mp4
││ --Nash Equilibria.srt
││
│├─{4}--10.4 Price of Stability
││ --Price of Stability.mp4
││ --Price of Stability.srt
││
│└─{5}--Lecture note 10
│ #10.5.1#--Lecture note 10 Local Search.pdf
│ (10.5.1)--10localsearch.ppt
│
├─{11}--11 Randomized Algorithms
│├─{1}--11.1 Contention Resolution
││ --Contention Resolution.mp4
││ --Contention Resolution.srt
││
│├─{2}--11.2 Linearity of Expectation
││ --Linearity of Expectation.mp4
││ --Linearity of Expectation.srt
││
│├─{3}--11.3 MAX 3-SAT
││ --MAX 3-SAT.mp4
││ --MAX 3-SAT.srt
││
│├─{4}--11.4 Chernoff Bounds
││ --Chernoff Bounds.mp4
││ --Chernoff Bounds.srt
││
│└─{5}--Lecture note 11
│ #11.5.1#--Lecture note 11 Randomized Algor.pdf
│ (11.5.1)--11randomized.ppt
│
**** Hidden Message *****
确实是难得好帖啊，顶先 确实是难得好帖啊，顶先 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！
页:
[1]
2