Lecture 21

Today we saw the completion of Sudan-Trevisan-Vadhan's proof of the Impagliazzo-Wigderson Theorem: if there is a positive $\epsilon >0$ such that $E$ contains a language not in $SIZE\left(2^{\epsilon n}\right)$, then $P=BPP$. This included Sudan's algorithm for list-decoding Reed-Solomon codes.