Today we covered...
Completion of proof of Impagliazzo's Hard-Core Set Theorem, Yao's XOR Lemma. Intro to error-correcting codes, list-decodable codes, locally decodable codes. Reed-Solomon codes, Hadamard codes, Reed-Muller codes. Connection between local list-decoding and hardness amplification.
skip to main |
skip to sidebar
Labels
- Lecture Summary (28)
- Announcement (21)
- Beyond the Lectures (15)
- Lecture Details (3)
- Encoding (1)
- Kolmogorov (1)
- Learning Theory (1)
- NP (1)
- complexity classes (1)
- derandomization (1)
- descriptive complexity theory (1)
Posts
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.