| 日期 | 進度 | 作業/考試/參考資料 |
| 2/26 | Introduction | |
| 3/5 | The computational model | |
| 3/12 | ||
| 3/19 | NP and NP completeness | |
| 3/26 | ||
| 4/2 | Diagonalization | |
| 4/9 | ||
| 4/16 | Space complexity | |
| 4/23 | 期中考 | |
| 4/30 | The polynomial hierarchy and alternations | |
| 5/7 | ||
| 5/14 | Boolean circuits | |
| 5/21 | ||
| 5/28 | Randomized computation | |
| 6/4 | ||
| 6/11 | Interactive proofs | |
| 6/18 | ||
| 6/25 | 期末考 | 期末考成績 |
* 授課內容可能會視上課情況臨時調整修改