1. Space complexity
姚鹏晖
助教: 刘明谋
答疑时间: 周四 2pm-4pm, 计算机科学与技术楼 502

2. What we have learnt The complexity classes P, NP,Co-NP, EXP, NEXP
Reductions, NP-hard problems, NP-complete problems
Diagonalization

3. Space-bounded computation

4. Space-constructible functions

5. Time complexity vs space complexity

6. Configuration graph

7. Time complexity vs space complexity

8. Space complexity classes

9. Space Hierarchy Theorem

10. PSPACE Completeness

11. PSPACE Completeness

12. PSPACE Completeness

13. PSPACE Completeness

14. Savitch’s theorem