MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: [ Ссылка ]
YouTube Playlist: [ Ссылка ]
Quickly reviewed last lecture. Covered NP-completeness; SAT and 3SAT; and more. Discussed a strategy for proving NP-completeness with a reduction from 3SAT by constructing gadgets that simulate variables and clauses.
License: Creative Commons BY-NC-SA
More information at [ Ссылка ]
More courses at [ Ссылка ]
Support OCW at [ Ссылка ]
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 [ Ссылка ].
