Computational Complexity Jan-April 2016
Final Exam Solution Key here Course Plan and Evaluation Policy here A Nice survey on Complexity theory here Reading Assignment: if NP is contained in P/POLY, then MA=AM here Arthur Merlin Protocols (Unknown source) here Assignment I here Assignment II here Assignment III here An Old Assignment here Collapse of the Polynomial Hierarchy 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