R8. NP-Complete Problems - MIT 6.046J Design and Analysis of Algorithms (Spring 2015)
Lecture covering NP-Complete problems from MIT's 6.046J course, taught by Amartya Shankha Biswas, Spring 2015.
MIT OpenCourseWare
135.7K views • Mar 4, 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: Amartya Shankha Biswas
In this recitation, problems related to NP-Completeness are discussed.
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: Amartya Shankha Biswas
In this recitation, problems related to NP-Completeness are discussed.
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
135.7K
Likes
1.5K
Duration
45:47
Published
Mar 4, 2016
User Reviews
4.5
(27) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.