Css 203 1 Computational Complexity Lecture 31

Summary

Agenda: Razborov and Smolensky's proof that Parity is not in AC0 Instructor: Ramprasad Saptharishi. MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... Agenda: Conclusion - What we saw and didn't see in this course Instructor: Ramprasad Saptharishi. Agenda: Hardness of approximating clique (FGLSS reduction), PCPs and more Instructor: Prahladh Harsha. Agenda: Administrivia; problems of interest: GCD, primality, connectivity, matching, determinant, SAT, CNF-minimization, ... Agenda: Approximate counting with an NP oracle; self-reducibility properties of the Permanent Instructor: Ramprasad Saptharishi. Agenda: Cook-Levin Theorem, decision vs. search, downward self-reducibility of SAT, coNP, padding techniques: P vs NP and ... Agenda: IP ⊂ PSPACE; P^ ⊂ IP (via extension to TQBF; IP = PSPACE 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: What is a proof?; Graph non-isomorphism; Interactive Proofs (formal definition); what we can prove; an interactive proof ...