Hellow guys, Welcome to my website, and you are watching 16. Complexity: P, NP, NP-completeness, Reductions. and this vIdeo is uploaded by MIT OpenCourseWare at 2016-06-13T12:31:33-07:00. We are pramote this video only for entertainment and educational perpose only. So, I hop you like our website.
| Name | 16. Complexity: P, NP, NP-completeness, Reductions |
| Video Uploader | Video From MIT OpenCourseWare |
| Upload Date | This Video Uploaded At 13-06-2016 15:31:33 |
| Video Discription | 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 |
| Category | Education |
| Tags | NP-complete | NP-hard | 3SAT | subset sum | partition |
