18. Complexity: Fixed-Parameter Algorithms

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: ocw.mit.edu/6-0...
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 ocw.mit.edu/terms
More courses at ocw.mit.edu

[@lauroprea1113]

This has been one of the best courses I’ve ever ‘attended’ , having a great pace and all the information I needed

[@AnnMrsGauss]

Both the lecture and professor are awesome 😃

[@JuanPabloCarbajal]

This guy is an superb teacher!

[@grigoriperelman4903]

We love you and support you PROFESSOR

[@Marcochampion99]

Nice video, definitely helping on my test this friday!

[@tttttttts7722]

Thanks for this awesome lecture!!!

[@mrbeanfan7217]

Absolutely brilliant intuitions...
I loved it

[@AndyPayne42]

This is awesome...going to start using these concepts on my socket servers

[@PauloConstantino167]

Still waiting for the guitar solo.

[@amiyancandol4499]

Great! Really enjoyed :)

[@keonook]

Thank you so much for this! This was amazing!

[@jan-rw2qx]

Thanks!

[@grigoriperelman4903]

Finally!!! The MAN

[@litoboy5]

great

[@mihirsakaria6690]

whats with the frisbee?

[@magicvibrations5180]

Positive reinforcement :)

[@satyambhardwaj2289]

Eric has holes in his shirt. ..oh sure ventilation.science guiy