The Wayback Machine - https://web.archive.org/web/20030805021413/http://www.courses.fas.harvard.edu:80/~cs225/
Harvard University FAS Shield
Spring 2002
 
Syllabus
Teaching Staff
Assignments
eMailbag
Scribenotes

Computer Science 225

Pseudorandomness

Salil Vadhan


 
Efficiently generating objects that ``look random" despite being constructed using little or no randomness. Connections and applications to computational complexity, cryptography, and combinatorics. Pseudorandom generators, randomness extractors, expander graphs, error-correcting codes, hash functions.

 


URL: http://www.courses.fas.harvard.edu/~cs225/
Last modified: 07/16/2002

Instructor's Toolkit  (PIN)  (Unix)
Copyright ©The President and Fellows of Harvard College