Css 203 1 Computational Complexity Lecture 11

Summary

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... Agenda: TBA Instructor: Prahladh Harsha. Agenda: Immerman–Szelepcsényi theorem; introduction to the polynomial hierarchy (definition via quantifiers and oracles) ... Agenda: Savitch's theorem; logspace reductions; L, NL, coNL, complete problems and relationships Instructor: Prahladh Harsha. Agenda: decision vs counting; of of Permanent. Instructor: Ramprasad Saptharishi. Agenda: Polynomial hierarchy via oracle TMs; alternating TMs and classes; towards Agenda: Universal TM simulation, Classes P and NP, non-determinisim, polynomial Agenda: IP ⊂ PSPACE; P^ ⊂ IP (via extension to TQBF; IP = PSPACE Instructor: Prahladh Harsha. Agenda: Probabilistic classes, Error reduction, relationship to other Agenda: Toda's theorem: intro. to ⊕SAT, randomised reduction from PH to ⊕SAT, derandomisation via a query Instructor: ... Agenda: What is a proof?; Graph non-isomorphism; Interactive Proofs (formal definition); what we can prove; an interactive proof ... Agenda: Cook-Levin Theorem, decision vs. search, downward self-reducibility of SAT, coNP, padding techniques: P vs NP and ...