Css 203 1 Computational Complexity

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

Instructor: Ramprasad Saptharishi This is the first of three lectures building towards's Ryan Williams' recent breakthrough result ...

Agenda:

Agenda: Administrivia; problems of interest: GCD, primality, connectivity, matching, determinant, SAT, #SAT, CNF-minimization, ...

Agenda: Space

Agenda: Arthur-Merlin protocols, MA, AM, properties of AM protocols, GI - NP-complete? public coins = private coins. Instructor: ...

Agenda: IP ⊂ PSPACE; P^#P ⊂ IP (via #SAT); extension to TQBF; IP = PSPACE Instructor: Prahladh Harsha.

Agenda: What is a proof?; Graph non-isomorphism; Interactive Proofs (formal definition); what we can prove; an interactive proof ...

Agenda: Universal TM simulation, Classes P and NP, non-determinisim, polynomial

Agenda: Randomised space; Barrington's theorem Instructor: Ramprasad Saptharishi.

Agenda: Probabilistic classes, Error reduction, relationship to other

Agenda: Approximate counting with an NP oracle; self-reducibility properties of the Permanent Instructor: Ramprasad Saptharishi.