Exploring Hardness Assumptions Beyond NP ≠ P | CMU CS Theory Lecture 26a 🔍
Dive into Lecture 26a of the CS Theory Toolkit at CMU, where we explore advanced hardness assumptions beyond the classic NP ≠ P, expanding your understanding of computational complexity.
Ryan O'Donnell
979 views • Jul 14, 2020
About this video
The beginning of a lecture about alternative hardness assumptions beyond just the usual "NP ≠ P". Lecture 26 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.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
979
Likes
16
Duration
6:38
Published
Jul 14, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.