CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 1: Introduction
February 1, 2007 Based on scribe notes by Saurabh Sanghvi.
1
Course Overview
Over the past few decades, randomization has become one
CS 225: Pseudorandomness
Prof. Salil Vadhan
Problem Set 5
Assigned: Tue. Apr. 14, 2009
Due: Wed. Apr. 29, 2009(1 PM)
Recall that your problem set solutions must be typed. You can email your solutions
CS 225: Pseudorandomness
Prof. Salil Vadhan
Problem Set 3
Assigned: Tue. Mar. 10, 2009
Due: Wed. Apr. 1, 2009(1 PM)
Recall that your problem set solutions must be typed. You can email your solutions
CS 225: Pseudorandomness
Prof. Salil Vadhan
Problem Set 6
Assigned: Tue. Apr. 28, 2009
Due: Wed. May. 13, 2009(1 PM)
This problem set is a substitute for the nal exam. You must work alone (but you st
CS 225: Pseudorandomness Problem Set 1
Assigned: Tue. Feb. 3, 2009
Prof. Salil Vadhan
Due: Wed. Feb. 18, 2009(1 PM)
Recall that your problem set solutions must be typed. You can email your solutions
Foundations and Trends R in
sample
Vol. xx, No xx (xxxx) 171
c xxxx xxxxxxxxx
DOI: xxxxxx
Pseudorandomness II
Salil P. Vadhan1
1
Harvard UniversityCambridge, MA02138, USA, [email protected]arvard.edu
Abstr
2
The Power of Randomness
2.1
Polynomial Identity Testing
Before we study the derandomization of randomized algorithms, we will need some algorithms to
derandomize. This section introduces one such al
Foundations and Trends R in
sample
Vol. xx, No xx (xxxx) 182
c xxxx xxxxxxxxx
DOI: xxxxxx
Pseudorandomness I
Salil P. Vadhan1
1
Harvard UniversityCambridge, MA02138, USA, [email protected]
Abstra
CS 225: Pseudorandomness
Prof. Salil Vadhan
Problem Set 4
Assigned: Thus. Apr. 2, 2009
Due: Wed. Apr. 15, 2009(1 PM)
Recall that your problem set solutions must be typed. You can email your solutions
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 6: Basic Derandomization Techniques II
February 20, 2007 Based on scribe notes by Chun-Yun Hsiao and Vinod Vaikuntanathan. Gutfreund. Lecture given b
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 12: Constructing Extractors
March 20, 2007 Based on scribe notes by Adam Kirsch. In the previous lectures, we have seen that very good extractors exi
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 13: More Connections with Expanders
March 22, 2007 Based on scribe notes by Adam Kirsch and Alexandr Andoni.
1
Lossless Condensers vs. Expanders
Last
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 14: Error-Correcting Codes
April 3, 2007 Based on scribe notes by Sasha Schwartz and Adi Akavia.
1
Basic Denitions
The eld of coding theory is motiva
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 7: Expander Graphs
February 22, 2007
Based on scribe notes by Kartik Venkatram and Mihai Ptracu. a s
1
Expander Graphs
Now that we have seen a variet
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 8: Random Walks on Expanders
March 1, 2007 Based on scribe notes by Mihai Ptracu. a s
1
Rapid Mixing of Random Walks
From the previous lecture, we kn
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 2: Randomized Algorithms and Complexity Classes
February 3, 2007 Based on scribe notes by Grant Schoenebeck.
1
Polynomial Identity Testing
Before we
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 3: Sampling and Approximation Problems
February 8, 2007
Based on scribe notes by David Troiano, Grant Schoenebeck, and Brian Greenberg.
1
Sampling Pr
CS225: Pseudorandomness
Prof. Salil Vadhan
Lecture 5: Basic Derandomization Techniques
February 15, 2007 Based on scribe notes by Arthur Rudolph and Chun-Yun Hsiao.
1
Recap
Over the past few lectures,
4
Expander Graphs
Now that we have seen a variety of basic derandomization techniques, we will move on to study
the rst major pseudorandom object in this survey, expander graphs. These are graphs that