YOUR AD GOES HERE

Hardness vs. Randomness II: Graduate Complexity Lecture 25 at CMU

Published 16, Dec 2017

Ryan O'Donnell


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/)

Releted More Videos

  • Sorry!!! Nothing to show

You May Also Like

YOUR AD GOES HERE

YOUR AD GOES HERE