MIT OpenCourseWare: Free Courses from the institute podkast

14. P and NP, SAT, Poly-Time Reducibility

0:00
1:26:07
Do tyłu o 15 sekund
Do przodu o 15 sekund
MIT 18.404J Theory of Computation, Fall 2020Instructor: Michael SipserView the complete course: https://ocw.mit.edu/18-404JF20YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWYUploaded 06-10-21NOTE: 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-SAMore information at https://ocw.mit.edu/termsMore courses at https://ocw.mit.eduSupport OCW at http://ow.ly/a1If50zVRlQWe 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. Learn more about your ad choices. Visit megaphone.fm/adchoices Learn more about your ad choices. Visit megaphone.fm/adchoices

Więcej odcinków z kanału "MIT OpenCourseWare: Free Courses from the institute"