Time/Class:

Spring, 2016, Postgraduates'15.

Spring, 2015, Postgraduates'14.

Spring, 2014, Postgraduates'13.


Text:

Sanjeev Arora, Boaz Barak.

Computational Complexity.

Cambridge University Press, 2009.


ch01 - The computation model [​​ch01.pdf​​]

ch02 - NP and NP completeness [​​ch02.pdf​​]

ch03 - Diagonalization [​​ch03.pdf​​]

ch04 - Space complexity [​​ch04.pdf​​]

ch05 - The polynomial hierarchy and alternations [​​ch05.pdf​​]

ch07 - Randomized computation [​​ch07.pdf​​]