Hardness Assumptions Beyond NP ≠ P || @ CMU || Lecture 26a of CS Theory Toolkit
The beginning of a lecture about alternative hardness assumptions beyond just the usual "NP ≠ P". Lecture 26 of "CS Theory Toolkit": a semester-long graduat...
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Thailand under the topic 'สภาพอากาศ'.
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/)
Video Information
Views
979
Total views since publication
Likes
16
User likes and reactions
Duration
6:38
Video length
Published
Jul 14, 2020
Release date
Quality
hd
Video definition
About the Channel
Tags and Topics
This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:
Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.