通過條件
成 績 :60 分
-
The Complexity of Algorithms and the Lower Bounds of Problems
-
The Theory of NP-Completeness
-
The Greedy Method
-
The Divide-and-Conquer Strategy
-
Tree Searching Strategies
-
Prune-and-Search
-
Dynamic Programming
- 課程介紹
- 課程安排
- 評論