Uploaded April 2020 | Updated November 2026, 8 hours ago
The "Hardness vs. Randomness" paradigm, the statement of the Impagliazzo--Wigderson Theorem (BPP = P if, e.g., SAT requires exponential-size circuits), and Nisan's generator for space (seed length O(log n)^2 for log-space TMs). Lecture 12b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
. van Melkebeek lecture notes for CS880 at UW-Madison: http://pages.cs.wisc.edu/~dieter/Courses/2013s-CS880/Scribes/lectures.html
. Vadhan's monograph "Pseudorandomness": https://people.seas.harvard.edu/~salil/pseudorandomness/pseudorandomness-Aug12.pdf
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Filmed by Cole H. for Panopto (panopto.com/)
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
The "Hardness vs. Randomness" paradigm, the statement of the Impagliazzo--Wigderson Theorem (BPP = P if, e.g., SAT requires exponential-size circuits), and Nisan's generator for space (seed length O(log n)^2 for log-space TMs). Lecture 12b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
. van Melkebeek lecture notes for CS880 at UW-Madison: http://pages.cs.wisc.edu/~dieter/Courses/2013s-CS880/Scribes/lectures.html
. Vadhan's monograph "Pseudorandomness": https://people.seas.harvard.edu/~salil/pseudorandomness/pseudorandomness-Aug12.pdf
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Filmed by Cole H. for Panopto (panopto.com/)
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)










