15. #P and ASP

preview_player
Показать описание
MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
Instructor: Erik Demaine

In this lecture, Professor Demaine describes counting versions of NP problems.

License: Creative Commons BY-NC-SA
Рекомендации по теме
Комментарии
Автор

Where is the lecture containing the problems and reductions that you begin referring to from around 17:00? Thanks.

jamess