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.
Lecturer
Date
8th October ~ 31st December, 2024
Location
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| Tuesday | 14:20 - 17:50 | A3-2a-201 | ZOOM 01 | 928 682 9093 | BIMSA |
Syllabus
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.
Audience
Advanced Undergraduate
, Graduate
Video Public
No
Notes Public
No
Language
Chinese
Lecturer Intro
Hanru Jiang is an Associate Researcher at BIMSA. He received his Ph.D. in Computer Science and Technology from the University of Science and Technology of China in 2019. From 2019 to 2020, he was an Assistant Researcher at the Quantum Computing Research Center, Peng Cheng Laboratory. His research interests lie in programming language theory, formal verification of compilers, and programming language issues in quantum computing. His work has been published in premier venues such as PLDI, CAV, and OOPSLA. He was a recipient of the PLDI 2019 Distinguished Paper Award.