Lecture Notes
Lecture 8
Description:
Lecture notes on polynomial time, computability, complexity, the meaning of efficient, the longest increasing subsequence of numbers, stable marriage, and examples.
Resource Type:
Lecture Notes
pdf
181 kB
Lecture 8
Course Info
Instructor
Departments
As Taught In
Spring
2008
Level
Topics
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
