Computational Complexity Jan-April 2018

Course Plan and Evaluation Policy here

Assignment I here

Assignment II here

Hardness of Approximation (Prof. V. Vazirani, Georgia Tech.) here

Circuit Complexity Lecture notes (Prof. Oded Goldreich, Weizmann Institute) here

Polynomial Hierarchy (Prof. Scott Aaronson, University of Texas) here

Professor Jonathan Katz (Maryland) lecture notes can be downloaded from here

Professor Jaikumar Radhakrishnan (TIFR Mumbai) lecture notes can be downloaded from here

Professor Luca Trevisan's (UC Berkely/Stanford)lecture notes here

Draft version of Professor Sanjeev Arora's (Princeton) book available at: "theory.cs.princeton.edu/complexity"

Jan 2016 Course Page here

Jan 2014 Course Page here

Aug 2007 Course Page here



Page Maintained by:
Murali Krishnan K, Faculty CSED
Email     : kmurali@nitc.ac.in