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•45:47

🔥 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 Saudi Arabia under the topic 'new zealand national cricket team vs west indies cricket team match scorecard'.

Trending Now Globally
new zealand national cricket team vs west indies cricket team match scorecard
50K+
new zealand national cricket team vs west indies cricket team match scorecard
50K+
cruz azul - pumas
50K+
chelsea vs wolves
50K+
เชลซี พบ วูล์ฟแฮมป์ตัน
20K+
sorteios loteria federal
20K+

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

Video Information

Views
135.7K

Total views since publication

Likes
1.5K

User likes and reactions

Duration
45:47

Video length

Published
Mar 4, 2016

Release date

Quality
hd

Video definition

Captions
Available

Subtitles enabled

About the Channel

MIT OpenCourseWare

View channel →

Tags and Topics

This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:

#NP-Complete #Hamiltonian cycle #Hamiltonian path #vertex cover

Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.