Lecture Notes
Introduction to Computational Complexity
Description:
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
pdf
130 kB
Introduction to Computational Complexity
Course Info
Instructor
Departments
As Taught In
Spring
2008
Level
Topics
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
