计算复杂性 (Fall 2018): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>TCSseminar
No edit summary
imported>TCSseminar
No edit summary
Line 64: Line 64:


= Course info =
= Course info =
* '''Instructor ''': 姚鹏晖
* '''Instructor ''': 姚鹏晖 ([mailto:pyao@nju.edu.cn pyao@nju.edu.cn])
:*'''Email''': pyao@nju.edu.cn
* '''Teaching assistant''': 刘明谋 ([mailto:liu.mingmou@smail.nju.edu.cn liu.mingmou@smail.nju.edu.cn])
* '''Teaching assistant''': 刘明谋
:*'''Email''': liu.mingmou@smail.nju.edu.cn
* '''Class meeting''': Thursday, 10:10-12:00, 仙I-204.
* '''Class meeting''': Thursday, 10:10-12:00, 仙I-204.
* '''Office hour''': Thursday, 14:00-16:00, 计算机系 502.
* '''Office hour''': Thursday, 14:00-16:00, 计算机系 502.

Revision as of 10:38, 13 September 2018

计算复杂性
Computational Complexity
Instructor
姚鹏晖
Email 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
51_KWx_I1yyy_L.jpg
Arora and Barak.
Computational Complexity: A Modern Approach.
Cambridge Univ Press, 2009.
Teaching Assistant
刘明谋
Email liu.mingmou@smail.nju.edu.cn
Office 计算机系 412
v · d · e


Announcement

  • (2018/9/6) 新学期第一堂课。


Course info

Course materials


Assignments

  • TBA

Lecture Notes

  1. 图灵机、计算复杂性类 P (sides)
  2. NP 和 NP 完全问题
  3. 对角化方法
  4. 空间复杂度
  5. 多项式谱系
  6. 布尔线路
  7. 随机计算
  8. 交互证明
  9. 前沿课题介绍