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

Описание к видео 16. Complexity: P, NP, NP-completeness, Reductions

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

Комментарии

Информация по комментариям в разработке