CS 225: Pseudorandomness (Fall 2016)

Most recently taught in Fall 2016. Previously taught in Spring 2002, Spring 2004, Spring 2007, SPring 2009, Spring 2011, and Spring 2015.

Course Description
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. 

Fall 2016

• Syllabus
• Guidelines for Reading, Commenting, and Class Participation
• Course schedule
• Canvas site
• Piazza
• NB

Textbook: Pseudorandomness

Past Offerings

Spring 2015

• Syllabus
• Guidelines for Reading, Commenting, and Class Participation
• Course schedule
• Textbook: Pseudorandomness

Spring 2011

• Syllabus
• Guidelines for Reading, Commenting, and Class Participation
• Course schedule
• Textbook: Pseudorandomness

Spring 2009

• Syllabus
• Lecture Notes
• Problem Sets

Spring 2007

• Syllabus
• Lecture Notes
• Problem Sets

Spring 2004

• Syllabus

Spring 2002

• Syllabus