6.080 | Spring 2008 | Undergraduate

Great Ideas in Theoretical Computer Science

Lecture Notes

Lecture 12

Description:

Lecture notes on space complexity, the P versus NP problem, and randomness.

Resource Type:
Lecture Notes
pdf
156 kB
Lecture 12
Download File

Course Info

Departments

As Taught In

Spring 2008

Level

Undergraduate

Topics

Learning Resource Types

Lecture Notes
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology