Css 203 1 Computational Complexity Lecture 32

Summary

Agenda: Conclusion - What we saw and didn't see in this course Instructor: Ramprasad Saptharishi. MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine ... Agenda: Cook-Levin Theorem, web of reductions, decision vs. search, downward self-reducibility of SAT. Agenda: Universal TM simulation, Classes P and NP, non-determinisim, polynomial Agenda: Toda's theorem: intro. to ⊕SAT, randomised reduction from PH to ⊕SAT, derandomisation via a query Instructor: ... 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, ... MIT 6.100L Introduction to CS and Programming using Python, Fall 2022 Instructor: Ana Bell View the complete course: ... Agenda: Arthur-Merlin protocols, MA, AM, properties of AM protocols, GI - NP-complete? public coins = private coins. Instructor: ... Agenda: What is a proof?; Graph non-isomorphism; Interactive Proofs (formal definition); what we can prove; an interactive proof ... Agenda: TBA Instructor: Prahladh Harsha. Agenda: decision vs counting; of of Permanent. Instructor: Ramprasad Saptharishi.