MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
View the complete course: [ Ссылка ]
Instructor: Erik Demaine

In this lecture, Professor Demaine introduces the concept of 3-partition and its many variations, a starting point for NP-hardness reductions. Weak and strong NP-hardness proofs are seen in the context of other examples.

License: Creative Commons BY-NC-SA
More information at [ Ссылка ]
More courses at [ Ссылка ]

свернуть