| 日期 | 進度 | 作業/考試/參考資料 |
| 9/20 | Introduction | slides |
| 9/27 | Turing Machine | slides |
| 10/11 | Turing Machine | |
| 10/18 | Boolean Logic | slides |
| 10/25 | Complexity Classes | slides |
| 11/1 | Reduction and NP-completeness | slides |
| 11/8 | NP-completeness Problems | slides |
| 11/15 | 期中考 | 考題 考古題 [1] [2] [3] [4] [5] |
| 11/22 | coNP (I) | slides |
| 11/29 | coNP (II) | |
| 12/6 | Randomized Computation (I) | slides |
| 12/13 | Randomized Computation (II) | slides |
| 12/20 | Cryptography | |
| 12/27 | Cryptography | slides (完整檔案) |
| 1/3 | Approximability | |
| 1/10 | Approximability | slides (完整檔案) |
| 1/17 | 期末考 | 期末考成績 |