Completed
Introduction: Derandomization
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Nearly Optimal Pseudorandomness From Hardness
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Introduction: Derandomization
- 3 Randomized vs. Deterministic Time Example
- 4 General Approach to Derandomization: Pseudorandom Generators
- 5 Parameter Overview
- 6 Jumping Off Point: STV01
- 7 1-Bit Stretch
- 8 New Approach: Codes with Large Alphabet
- 9 A Notion of Pseudoentropy
- 10 Definition of Locally List Recoverable Codes
- 11 Pseudoentropy from LLRC
- 12 Extracting from Pseudoentropy
- 13 Conclusion
- 14 Open Questions
