CS6850 : Computational Complexity Theory
CS6850 : (Topics in) Complexity Theory
Home               Information               Lectures               Problem Sets               References
Details of each lecture are recorded here in the reverse chronological order.
Click on the theme item for the lecture plan for that section.
Click on the lecture item for suggested additional reading related to it.
The notes for the lectures are available at the moodle webpage of the course.
Theme 1: P vs NP : Time Complexity Classes, Reductions and Completeness. (9 meetings)
Theme 2: Below P and Above NP : Space Complexity Classes, Algorithms.(10 meetings)
Theme 3: Between P and PSPACE : PH, #P, PP, ParityP, BPP, RP (15 meetings)
Theme 4: Non-uniform Models and Lower Bounds (16 meetings)
Theme 5: Deranodomization, Hardness vs Randomness (6 meetings)
Theme 6: Probablistic Proof Systems (2 meetings)




Last updated on Fri May 13 21:08:49 IST 2011