A Reduction from Efficient Non-Malleable Extractors to Low-Error Two-Source Extractors
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=9mbhYfW1oac
Dean Doron, Tel Aviv University
https://simons.berkeley.edu/talks/dean-doron-2017-03-10
Proving and Using Pseudorandomness
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Proving and Using Pseudorandomness
Dean Doron