6.841 Advanced Complexity Theory
May 7, 2007
Lecture 23
Lecturer: Madhu Sudan Scribe: Alex Andoni, Anastasios Sidiropoulos
1
Overview
Continue the discussion on Average-Case analysis (as opposed to Worst Case); Present Impagliazzos ve possible worldsl Ad
6.841 Advanced Complexity Theory
March 19, 2007
Lecture 12
Lecturer: Madhu Sudan Scribe: Suho Oh, Jose Soto
1
Overview
Randomized Reductions. Valiant-Vazirani: SAT RP U nique-SAT . Todas Theorem: P H P #P .
2
The Theorem of Valiant-Vazirani.
To state thi
6.841 Advanced Complexity Theory
April 18, 2007
Lecture 18
Lecturer: Madhu Sudan Scribe: Nadia Benbernou
1
Probabilistically Checkable Proofs (PCP)
The goal of a probabilistically checkable proof is to verify a proof by looking at only a small number of b
6.841 Advanced Complexity Theory
April 9, 2007
Lecture 16
Lecturer: Madhu Sudan Scribe: Amanda Redlich, Shubhangi Saraf
1
Overview
Permanent: worst case average case Permanent IP towards IP PSPACE
In todays lecture we will cover the following
2
The Perma
6.841 Advanced Complexity Theory
May 11, 2009
Lecture 25
Lecturer: Madhu Sudan Scribe: Rishi Gupta
Write your feedback for the course at https:/sixweb.mit.edu/student/evaluate/6.841-s2009. It will help future students decide whether they should take the c
6.841 Advanced Complexity Theory
March 9, 2009
Lecture 10
Lecturer: Madhu Sudan Scribe: Asilata Bapat
Meeting to talk about nal projects on Wednesday, 11 March 2009, from 5pm to 7pm. Location: TBA. Includes food.
1
Overview of todays lecture
Randomized c
6.841 Advanced Complexity Theory
Mar 04, 2009
Lecture 09
Lecturer: Madhu Sudan Scribe: Jeremy Hurwitz
In this lecture, we introduce a new model of computation and a set of corresponding complexity classes which sit between N P and P SP ACE . This model is
6.841 Advanced Complexity Theory
Mar 02, 2009
Lecture 08
Lecturer: Madhu Sudan Scribe: Vartika Singh
1
Alternation
It is a notion which tries to capture languages in N P and CoN P in a unifying way. It denes the time-vs-space relation and hence Alternatin
6.841 Advanced Complexity Theory
Feb 7, 2005
Lecture 7: Communication Complexity and Lower Bounds
Lecturer: Madhu Sudan Scribe: David Chen
This lecture gives an introduction to Communication Complexity. We go over the properties and examples of Communicat
6.841 Advanced Complexity Theory
Feb 23, 2009
Lecture 6
Lecturer: Madhu Sudan Scribe: Michael Forbes
The goal of this lecture is to give alternate proof of PARITY AC0 , following the outline of Razborov / and Smolensky.
0.1
Probability Review
Probability
6.841 Advanced Complexity Theory
Feb 18, 2009
Lecture 5
Lecturer: Madhu Sudan Scribe: Yang Cai
1
Overview
P ARIT Y AC 0 . / Random Restriction Switching Lemma DN F CN F
2
Introduction
AC k : Class of functions computable by polynomial size and O(log n)k