Multiplicative Extractors for Samplable Distributions

Learn about multiplicative extractors designed for samplable distributions in this 29-minute conference talk by Ronen Shaltiel from the Fields Institute. Explore the theoretical foundations and applications of these specialized randomness extractors that work with distributions that can be efficiently sampled, examining their construction methods and performance characteristics. Discover how multiplicative extractors differ from traditional extractors and understand their role in computational complexity theory and pseudorandomness. Gain insights into the mathematical techniques used to analyze these extractors and their connections to other areas of theoretical computer science, including derandomization and cryptography.