Understanding Probabilistic Complexity Classes: Graduate Lecture at CMU π
Explore the fundamentals of probabilistic complexity classes in this detailed graduate lecture from CMU's 15-855 course. Perfect for students and enthusiasts eager to deepen their understanding of computational complexity theory.

Ryan O'Donnell
2.3K views β’ Sep 19, 2017

About this video
Graduate Computational Complexity Theory
Lecture 5: Probabilistic Complexity Classes
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 Chapters 7.1--7.5 (except 7.5.2)
Filmed by Panopto (http://www.panopto.com/)
Lecture 5: Probabilistic Complexity Classes
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 Chapters 7.1--7.5 (except 7.5.2)
Filmed by Panopto (http://www.panopto.com/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
2.3K
Likes
31
Duration
01:20:55
Published
Sep 19, 2017
User Reviews
4.4
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.