Css 203 1 Computational Complexity Lecture 28

Summary

Agenda: Multiprover interactive proofs (MIP), MIP=NEXP, Introduction to PCPs, The PCP Theorem Instructor: Prahladh Harsha. Agenda: PCP Theorem(s) and applications to inapproximability results Instructor: Prahladh Harsha. MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... 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: Savitch's theorem; logspace reductions; L, NL, coNL, complete problems and relationships Instructor: Prahladh Harsha. Agenda: Hardness of approximating clique (FGLSS reduction), PCPs and more Instructor: Prahladh Harsha. Agenda: Cook-Levin Theorem, decision vs. search, downward self-reducibility of SAT, coNP, padding techniques: P vs NP and ... Agenda: Approximate counting with an NP oracle; self-reducibility properties of the Permanent Instructor: Ramprasad Saptharishi. Agenda: IP ⊂ PSPACE; P^ ⊂ IP (via extension to TQBF; IP = PSPACE Instructor: Prahladh Harsha. Agenda: Immerman–Szelepcsényi theorem; introduction to the polynomial hierarchy (definition via quantifiers and oracles) ...