Introduction to Computational Complexity
In this course we start from foundational models like Turing machines, and move through classical complexity classes (P, NP, PSPACE, etc.). Topics include reducibility, completeness, and hierarchy theorems. Advanced topics include complexity of counting, randomness, circuit complexity, and interactive proofs.
讲师
日期
2024年10月08日 至 12月31日
位置
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| 周二 | 14:20 - 17:50 | A3-2a-201 | ZOOM 01 | 928 682 9093 | BIMSA |
课程大纲
Turing machines and computability.
P, NP, reducibility, NP-completeness, and Cook-Levin theorem.
Time hierarchy theorem, Ladner's theorem.
PSPACE, NL.
\Sigma^p_2, Polynomial hierarchy, time-space tradeoffs.
Boolean circuits: P/poly.
Probabilistic TMs: RP, ZPP, BPP.
Interactive proofs: IP, AM, MIP.
Quantum: BQP.
Approximation: PCP theorems.
Counting: #P, Toda's theorem.
P, NP, reducibility, NP-completeness, and Cook-Levin theorem.
Time hierarchy theorem, Ladner's theorem.
PSPACE, NL.
\Sigma^p_2, Polynomial hierarchy, time-space tradeoffs.
Boolean circuits: P/poly.
Probabilistic TMs: RP, ZPP, BPP.
Interactive proofs: IP, AM, MIP.
Quantum: BQP.
Approximation: PCP theorems.
Counting: #P, Toda's theorem.
听众
Advanced Undergraduate
, Graduate
视频公开
不公开
笔记公开
不公开
语言
中文
讲师介绍
蒋瀚如，现任BIMSA副研究员。他于2019年在中国科学技术大学获得计算机科学与技术博士学位。2019年至2020年间，在鹏城实验室量子计算研究中心担任助理研究员。主要研究方向包括程序设计语言理论、编译器的形式化验证以及量子计算中的程序语言问题。其研究成果多次发表于 PLDI、CAV、OOPSLA 等程序语言领域的顶尖国际会议及期刊，曾获 PLDI 2019 杰出论文奖。