16. Cook-Levin Theorem
Автор: MIT OpenCourseWare
Загружено: 2021-10-06
Просмотров: 28704
Описание:
MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: https://ocw.mit.edu/18-404JF20
YouTube Playlist: • MIT 18.404J Theory of Computation, Fall 2020
Quickly reviewed last lecture. Proved Cook-Levin Theorem: SAT is NP-complete. Also proved 3SAT is NP-complete.
License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
