Video: Dana Moshkovitz, "Nearly Optimal Pseudorandomness From Hardness"

Video From 19w5088: Algebraic Techniques in Computational Complexity

Dana Moshkovitz, University of Texas - Austin

Monday, July 8, 2019 10:07 - 11:00

Nearly Optimal Pseudorandomness From Hardness

Dana Moshkovitz, Video: Nearly Optimal Pseudorandomness From Hardness

Dana Moshkovitz, Nearly Optimal Pseudorandomness From Hardness, Algebraic Techniques in Computational Complexity , BIRS, BIRS talk, 19w5088, math, mathematics, video

Banff International Research Station

presentation

mpeg4

342M

http://www.birs.ca/events/2019/5-day-workshops/19w5088/videos

http://www.birs.ca/events/2019/5-day-workshops/19w5088/videos/watch/201907081007-Moshkovitz.html

0 seconds of 0 secondsVolume 90%

00:00

This video file cannot be played.(Error Code: 224003)

Download this video (342M)