Harvard University

Course Website Locator

COMPSCI 225 Fall 2016-2017 / Section: 001 / Class number: 24635

Pseudorandomness
Maxwell Dworkin 323 (SEAS)
Tuesday, Thursday 1:00pm - 2:29pm

Course website Warning! This Canvas course has been concluded. Only prior members of the course can access the site.

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.

Computer Science 225 Spring 2014-2015

Pseudorandomness
Salil P. Vadhan
Maxwell Dworkin 319
Tu., Th., 10-11:30

Course website Warning! This Canvas course has been concluded. Only prior members of the course can access the site.

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.

Computer Science 225 Spring 2010-2011

Pseudorandomness
Salil P. Vadhan
Maxwell Dworkin 323
M., W., 2:30-4

Course website

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.