Study Group

From TCS Wiki
Revision as of 05:36, 12 June 2018 by imported>TCSseminar (→‎计算复杂性 Computational Complexity)
Jump to navigation Jump to search
  • 这是南京大学理论计算机科学学习小组的主页。
  • 本学习小组由学生组织,旨在学习理论计算机科学的基础知识。
  • 本学习小组对外开放,欢迎各方向的老师、研究生、以及本科生来参加。

计算复杂性 Computational Complexity

时间地点 Speakers Topics Readings

7:00pm, 2018/6/15
计算机系楼 225

刘明谋

Interactive Proofs (Ⅱ).

Sanjeev Arora and Boaz Barak's Book: Chapter 8

7:00pm, 2018/6/7
计算机系楼 224

宋仁杰

Class #P.

Sanjeev Arora and Boaz Barak's Book: Chapter 9
Mark Jerrum's lecture notes

7:00pm, 2018/5/31
计算机系楼 224

刘雅辉

Alternating Turing machines.

Sanjeev Arora and Boaz Barak's Book: Chapter 5

7:00pm, 2018/5/25
计算机系楼 225

刘明谋

Interactive Proofs (Ⅰ).

Sanjeev Arora and Boaz Barak's Book: Chapter 8

3:00pm, 2018/4/20
计算机系楼 224

刘雅辉

Polynomial Hierarchy.

Sanjeev Arora and Boaz Barak's Book: Chapter 5

3:00pm, 2018/4/12
计算机系楼 229

潘笑吟

Space Complexity.

Sanjeev Arora and Boaz Barak's Book: Chapter 4

3:00pm, 2018/3/29
计算机系楼 319

陈海敏
凤维明

Class coNP and Randomized Computation.

Sanjeev Arora and Boaz Barak's Book: Chapter 2, Chapter 7.

3:00pm, 2018/3/22
计算机系楼 319

凤维明

Class NP and Reductions.

Sanjeev Arora and Boaz Barak's Book: Chapter 2

3:00pm, 2018/3/15
计算机系楼 319

樊一麟

Turing Machines and Class P.

Sanjeev Arora and Boaz Barak's Book: Chapter 1