Lecture Notes
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 20 Notes
Description:
This resource contains information related to undecidability & P-completeness.
Resource Type:
Lecture Notes
pdf
6 MB
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 20 Notes
Course Info
Instructor
Departments
As Taught In
Fall
2014
Level
Topics
Learning Resource Types
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
group_work
Projects
