16. Understanding P, NP, and NP-Completeness in Algorithms 🧩
Explore the fundamental concepts of computational complexity, including P, NP, NP-completeness, and reductions, in this MIT lecture by Erik Demaine. Perfect for deepening your algorithm knowledge!
MIT OpenCourseWare
460.7K views • Jun 13, 2016
About this video
MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Erik Demaine
In this lecture, Professor Demaine introduces NP-completeness.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Erik Demaine
In this lecture, Professor Demaine introduces NP-completeness.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
460.7K
Likes
6.8K
Duration
01:25:25
Published
Jun 13, 2016
User Reviews
4.7
(92) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.