18. Complexity: Fixed-Parameter Algorithms

Описание к видео 18. Complexity: Fixed-Parameter Algorithms

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 tackles NP-hard problems using fixed-parameter algorithms.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Комментарии

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