6.080 | Spring 2008 | Undergraduate

Great Ideas in Theoretical Computer Science

Lecture Notes

Lecture 14

Description:

Lecture notes on probabilistic complexity classes, randomness, and useful probability formulas.

Resource Type:
Lecture Notes
pdf
130 kB
Lecture 14
Download File
DOWNLOAD

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–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology