Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Teaches extractors for independent sources in randomness theory. A lecture on computational complexity and cryptographic foundations.

A 59-minute video from Microsoft Research: “Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources”.

Video by Microsoft Research, played through YouTube's embedded player.