
Grade:60 Fraction
-
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
- Course Introduction
- Course Plan
- 評論