Understanding NP-Completeness & the Cook-Levin Theorem | CMU Lecture 11 🔍
Dive into Lecture 11 of Carnegie Mellon's 15-455 course to explore NP-Completeness and the groundbreaking Cook-Levin Theorem, essential concepts in computational complexity theory.
Ryan O'Donnell
2.5K views • Jun 24, 2017
About this video
Undergraduate Computational Complexity Theory
Lecture 11: NP-Completeness and the Cook--Levin Theorem
Carnegie Mellon Course 15-455, Spring 2017
(http://www.cs.cmu.edu/~15455/)
Guest lecture by Yu Zhao
(https://www.cs.cmu.edu/~yuzhao1/)
Suggested reading: Sipser Ch. 9.3 and rest of Ch. 7.4
Filmed by Panopto (http://www.panopto.com/)
Lecture 11: NP-Completeness and the Cook--Levin Theorem
Carnegie Mellon Course 15-455, Spring 2017
(http://www.cs.cmu.edu/~15455/)
Guest lecture by Yu Zhao
(https://www.cs.cmu.edu/~yuzhao1/)
Suggested reading: Sipser Ch. 9.3 and rest of Ch. 7.4
Filmed by Panopto (http://www.panopto.com/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
2.5K
Likes
24
Duration
01:16:03
Published
Jun 24, 2017
User Reviews
4.2
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now