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'Donnell979 views6:38

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

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.

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

Related Trending Topics

LIVE TRENDS

This 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 Morocco under the topic 'météo demain'.

Share This Video

SOCIAL SHARE

Share this video with your friends and followers across all major social platforms including X (Twitter), Facebook, Youtube, Pinterest, VKontakte, and Odnoklassniki. Help spread the word about great content!