Petar Maymounkov –
6.895 Randomness and Computation with Prof. Ronitt Rubinfeld,
Spring 2006
Here are my personal notes for
MIT course 6.895 Randomness and Computation with Prof. Ronitt Rubinfeld,
Spring 2006
Related links:
Scripted Notes:
- Script (2/8):
Polynomial zero testing
- Script (2/13):
Self-correcting programs
- Script (2/15):
Linearity testing, Fourier representation (Basics)
- Script (2/21):
Fourier representation (Functional distance)
- Script (2/22):
Sparse Fourier approximation, Goldreich-Levin algorithm
- Script (2/27):
Learning constant-depth circuits and decision trees
- Script (3/1):
Learning decision trees, and weakly learning monotone formulas, canonical path argument
- Script (3/6):
Uniformly sampling satisfying assignments of DNFs
Problem and Solution Sets:
|