6.080 | Spring 2008 | Undergraduate

Great Ideas in Theoretical Computer Science

Lecture Notes

Lecture 8


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

Course Info

As Taught In
Spring 2008
Learning Resource Types
Lecture Notes
Problem Sets