18.404J | Fall 2020 | Undergraduate, Graduate

Theory of Computation

Lecture 14: P and NP, SAT, Poly-time Reducibility

Resource Type:
Lecture Notes
pdf
494 kB
Lecture 14: P and NP, SAT, Poly-time Reducibility
Download File

Course Info

Departments
As Taught In
Fall 2020
Level
Undergraduate
Graduate
Topics
Learning Resource Types
Lecture Videos
Problem Sets
Exams
Lecture Notes
Instructor Insights
Editable Files
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology