6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity

Lecture Notes

MIT6_045JS11_lec15.pdf

Description:

This resource contains information related to Polynomial-time reducibility, NP-completeness, and the satisfiability(SAT) problem.

Resource Type:
Lecture Notes
pdf
156 kB
MIT6_045JS11_lec15.pdf
Download File
DOWNLOAD

Course Info

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