6.842 Randomness and Computation


Class Info

The power and sources of randomness in computation. Connections and applications to computational complexity, computational learning theory, cryptography and combinatorics. Topics include: probabilistic proofs, uniform generation and approximate counting, Fourier analysis of Boolean functions, computational learning theory, expander graphs, pseudorandom generators, derandomization.

This class has 6.046, and 18.4041 as prerequisites.

6.842 will not be offered this semester. It will be available in the Fall semester, and will be instructed by .

This class counts for a total of 12 credits. This is a graduate-level class.

You can find more information at the MIT + 6.842 - Google Search site.

MIT 6.842 Randomness and Computation Related Textbooks
MIT 6.842 Randomness and Computation On The Web

© Copyright 2015