教學內容 |
This course investigates several important algorithm topics. The covered issues in this course includes <ol> <li> Complexity of algorithms and lower bounds of problems <li> NP-complete <li> Greedy method <li> Divide-and-conquer <li> Tree searching strategies <li> Prune-and-search strategy <li> Dynamic programming <li> Approximation algorithms <li> Amortized analysis <li> Randomized algorithms </ol> |
Syllabus |
This course investigates several important algorithm topics. The covered issues in this course includes <ol> <li> Complexity of algorithms and lower bounds of problems <li> NP-complete <li> Greedy method <li> Divide-and-conquer <li> Tree searching strategies <li> Prune-and-search strategy <li> Dynamic programming <li> Approximation algorithms <li> Amortized analysis <li> Randomized algorithms </ol> |