16 Complexity P NP NPcompleteness Reductions
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=eHZifpgyH_4
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
#############################
