Fall'22: Complexity Of Computation (16:198:538)Thursday: 14:0017:00 This course will serve as an introductory graduate complexity theory course. There will be a special emphasis on providing a lot of context to the contents covered in the course. We will follow Wigderson's book and Goldreich's book. Additionally, the homeworks will serve the purpose of equipping the student with the requisite tools and background to better understand the lectures instead of serving as verfication mechanisms to see if the students have understood the course materials. Prerequisites: It will be helpful to have some background in algorithms/discrete math, but no formal prerequisite will be enforced. If you do not satisfy the official prerequisites but are still interested in registering for the course, and you are concerned if you will be sufficiently prepared for the course, please send me an email. The only real prerequisite is some mathematical maturity. Tentative list of topics that will be covered: Turing machines, Complexity Classes, P, NP, CookLevin Theorem, Hierarchy theorems, Ladnerâ€™s Theorem, Oracles and relativization, Space bounded complexity, NL, coNL, Polynomial Hierarchy and alternating Turing machines, Randomized computation, Interactive proofs, AM, MA, GoldwasserSipser set lower bound protocol, IP = PSPACE theorem, PCP Theorem. Grading: Scribing lectures (30%), Homework (70%). Topics and schedule
