演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第7行: | 第7行: | ||
[http://wmi.ee.nsysu.edu.tw/enter/images/8/84/Alg2021GrowthFunctionV8.pdf Chapter 2. Growth of Functions] | [http://wmi.ee.nsysu.edu.tw/enter/images/8/84/Alg2021GrowthFunctionV8.pdf Chapter 2. Growth of Functions] | ||
- | + | [http://wmi.ee.nsysu.edu.tw/enter/images/d/de/Alg2021DivideAndConquerV2.pdf <br>Chapter 3. Divide and Conquer] <br>更新時間 2021/03/22/15:40 | |
- | |||
- | |||
[http://wmi.ee.nsysu.edu.tw/enter/images/e/ef/Alg2021RandomizedAlg.pdf Chapter 4. Randomized Algorithms] | [http://wmi.ee.nsysu.edu.tw/enter/images/e/ef/Alg2021RandomizedAlg.pdf Chapter 4. Randomized Algorithms] |
在2021年3月22日 (一) 15:41所做的修訂版本
研究所課程, 2021 Spring, Thu 2:10~5:00 PM, EC3013
Chapter 2. Growth of Functions
Chapter 3. Divide and Conquer
更新時間 2021/03/22/15:40
Chapter 4. Randomized Algorithms
*Derandomization of MAX-3SAT (參考資料,自我學習,上課不教,考試不考)
Chapter 5. Dynamic Programming
Chapter 7. Graph Traversal Techniques
Chapter 8. Minimun Cost Spanning Tree
Chapter 11. Linear Programming and Its Application to Game Theory
註2:Relations between a primal problem and its dual problem
Chapter 13. Approximation Algorithms