14. Understanding P vs NP, SAT, and Polynomial-Time Reductions 🔍

MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: https://ocw.mit.edu/18-404JF20
YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY

NOTE: There is no video for Lecture 13 as that was the day for the Midterm Exam.

Quickly reviewed last lecture. Defined NTIME(t(n)) complexity classes and the class NP. Showed that COMPOSITES is in NP. Discussed the P versus NP question. Proved that acceptance problem for CFG is in P. Introduced the satisfiability problem SAT and polynomial-time reducibility.

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.