6.080 | Spring 2008 | Undergraduate

Great Ideas in Theoretical Computer Science

Lecture Notes

Introduction to Computational Complexity


Lecture notes on computational complexity, Penrose’s argument, the Dijkstra algorithm, efficiency, circuit complexity, Shannon’s counting argument, Hartmanis-Stearns, and notation for complexity.

Resource Type:
Lecture Notes

Course Info

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