Home » Education » 16. Complexity: P, NP, NP-completeness, Reductions

16. Complexity: P, NP, NP-completeness, Reductions

Written By MIT OpenCourseWare on Monday, Jun 13, 2016 | 03:31 PM

 
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

Disclaimer:
All images, musics and videos copyright are belong to their respective owners. We just put embed contents from Youtube.com and do not host any content in our server. These content(s) may be protected by copyright law or other laws regarding intellectual property of the United States or other countries. Downloading file(s) on this site is just for review purpose. If you love the song, please support the artists by buying the original CD/Cassette or buying the song from iTunes.