Description:
Graduate Computational Complexity Theory
Lecture 25: Hardness vs. Randomness II
Carnegie Mellon Course 15-855, Fall 2017
(http://www.cs.cmu.edu/~odonnell/complexity17/)
Taught by Ryan O'Donnell
(http://www.cs.cmu.edu/~odonnell)
Suggested reading: Arora--Barak Chapter 20.2
Filmed by Panopto (http://www.panopto.com/)
Share this link via
Or copy link























