Скачать
F2021 CS 411/811 Lecture 38 (NP-completeness, SAT, 3SAT, Vertex Cover, More NP-complete problems)
Автор: Dr. Daniel Page [CS University Lectures]
Загружено: 2021-12-06
Просмотров: 166
Описание:
This is the final lecture. We talked about NP-completeness, and some deep aspects of it. We didn't have time to talk about the application of reductions I wanted to touch upon, I included it in the notes for your own optional read.
Time Stamps:
0:00 Opening
2:37 NP-complete (review), Satisfiability Problem (SAT), Cook-Levin Theorem
15:25 More about NP-complete and NP-hard problems, some examples, 3SAT, more reductions
45:56 Vertex Cover is NP-complete (read proof)
1:02 Ending, closing, thank you!
Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
