Css 203 1 Computational Complexity Lecture 14

Summary

Agenda: Probabilistic classes, Error reduction, relationship to other Agenda: TBA Instructor: Prahladh Harsha. MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... Agenda: BPP error reduction, Chernoff Bound, BPP vs P/poly, BPP vs. PH, randomized space Instructor: Prahladh Harsha. Agenda: Arthur-Merlin protocols, MA, AM, properties of AM protocols, GI - NP-complete? public coins = private coins. Instructor: ... Agenda: decision vs counting; of of Permanent. Instructor: Ramprasad Saptharishi. Agenda: Cook-Levin Theorem, decision vs. search, downward self-reducibility of SAT, coNP, padding techniques: P vs NP and ... Agenda: Savitch's theorem; logspace reductions; L, NL, coNL, complete problems and relationships Instructor: Prahladh Harsha. Agenda: Toda's theorem: intro. to ⊕SAT, randomised reduction from PH to ⊕SAT, derandomisation via a query Instructor: ... Agenda: IP ⊂ PSPACE; P^ ⊂ IP (via extension to TQBF; IP = PSPACE Instructor: Prahladh Harsha. Agenda: Approximate counting with an NP oracle; self-reducibility properties of the Permanent Instructor: Ramprasad Saptharishi. Agenda: Immerman–Szelepcsényi theorem; introduction to the polynomial hierarchy (definition via quantifiers and oracles) ... Agenda: P ⊂ IP (via extension to TQBF, Arthur-Merlin protocols, properties of AM protocols, GI - NP-complete?