Css 203 1 Computational Complexity Lecture 13

Summary

Agenda: TBA Instructor: Prahladh Harsha. Amir Abboud, Weizmann Institute of Science, presents at the DIMACS Tutorial on Fine-grained MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... Agenda: Probabilistic classes, Error reduction, relationship to other Agenda: Cook-Levin Theorem, web of reductions, decision vs. search, downward self-reducibility of SAT. Agenda: Karp-Lipton and Meyer's theorem; Size hierarchy theorem; Turing Machines with advice; some important circuit classes ... Agenda: decision vs counting; of of Permanent. Instructor: Ramprasad Saptharishi. Agenda: Universal TM simulation, Classes P and NP, non-determinisim, polynomial Welcome back to cs103 machines languages and Agenda: BPP error reduction, Chernoff Bound, BPP vs P/poly, BPP vs. PH, randomized space Instructor: Prahladh Harsha. Agenda: Toda's theorem: intro. to ⊕SAT, randomised reduction from PH to ⊕SAT, derandomisation via a query Instructor: ... Agenda: Arthur-Merlin protocols, MA, AM, properties of AM protocols, GI - NP-complete? public coins = private coins. Instructor: ...