计算复杂性 (Fall 2018): Difference between revisions
Jump to navigation
Jump to search
imported>TCSseminar No edit summary |
imported>TCSseminar mNo edit summary |
||
| Line 79: | Line 79: | ||
= Lecture Notes = | = Lecture Notes = | ||
# 图灵机、计算复杂性类 P ([http://45.77.25.129:8000/lec1.pptx | # 图灵机、计算复杂性类 P ([http://45.77.25.129:8000/lec1.pptx slides]) | ||
# NP 和 NP 完全问题 | # NP 和 NP 完全问题 | ||
# 对角化方法 | # 对角化方法 | ||
Revision as of 14:20, 13 September 2018
| Instructor | |
|---|---|
| 姚鹏晖 | |
| pyao@nju.edu.cn | |
| Office | 计算机系 502 |
| Class | |
| Class meetings |
Thursday, 10:10-12:00 仙I-204 |
| Office hours |
Thursday, 14:00-16:00 计算机系 502 |
| Textbooks | |
 | |
|
Arora and Barak. Computational Complexity: A Modern Approach. Cambridge Univ Press, 2009. | |
| Teaching Assistant | |
| 刘明谋 | |
| liu.mingmou@smail.nju.edu.cn | |
| Office | 计算机系 412 |
Announcement
- (2018/9/6) 新学期第一堂课。
Course info
- Instructor : 姚鹏晖 (pyao@nju.edu.cn)
- Teaching assistant: 刘明谋 (liu.mingmou@smail.nju.edu.cn)
- Class meeting: Thursday, 10:10-12:00, 仙I-204.
- Office hour: Thursday, 14:00-16:00, 计算机系 502.
Course materials
- Arora and Barak. Computational Complexity: A Modern Approach. Cambridge Univ Press, 2009.
- Arora and Barak. 计算复杂性的现代方法. (英语). 世界图书出版公司. 2012.
- Arora and Barak. 计算复杂性:现代方法. (中文翻译). 机械工业出版社. 2016.
Assignments
- TBA
Lecture Notes
- 图灵机、计算复杂性类 P (slides)
- NP 和 NP 完全问题
- 对角化方法
- 空间复杂度
- 多项式谱系
- 布尔线路
- 随机计算
- 交互证明
- 前沿课题介绍