Extractors for Adversarial Sources via Extremal Hypergraphs
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
Explore the concept of extractors for adversarial sources through the lens of extremal hypergraphs in this 28-minute ACM conference talk. Delve into the fundamentals of extractors, randomness, and uniform bits before examining their practical applications. Gain insights into the latest research results and discover an improved framework for understanding these complex mathematical structures. Learn how this advanced topic in computer science and mathematics contributes to the development of more robust and efficient algorithms for handling adversarial data sources.
Syllabus
Introduction
Extractors
Randomness
Uniform Bits
Application
Results
Improved Framework
Taught by
Association for Computing Machinery (ACM)
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera