Video Lectures
Lecture 14: P and NP, SAT, Poly-Time Reducibility
Description: Quickly reviewed last lecture. Defined NTIME\((t(n))\) complexity classes and the class NP. Showed \(COMPOSITES\) ∈ NP. Discussed the P versus NP question. Proved \(A\)CFG ∈ P. Introduced the satisfiability problem \(SAT\) and polynomial-time reducibility.
Instructor: Prof. Michael Sipser
Viewing videos requires an internet connection
Course Info
Instructor
As Taught In
Fall
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
grading
Exams
notes
Lecture Notes
Instructor Insights