Results 351 - 360 of 24699
The hardness versus randomness paradigm (initiated by Blum, Micali, Yao, Nisan and Wigderson) aims to show that randomized complexity classes can be derandomized assuming that certain complexity theoretic hardness assumptions hold. The key concept in this research is that of a pseudorandom generator, which stretches a short seed of random bits into a long string of pseudorandom bits that cannot be distinguished from uniform bits by any efficient algorithm. In the talk I will survey classical constructions of pseudorandom generators based on hardness assumptions, as well as implications of these constructions. I will also try to broadly survey some of the more recent work in this area.
Slides: https://www.cs.haifa.ac.il/~ronen/online_papers/simons_talk.pdf
This workshop features alternating half-days of talks from the Pseudrorandomness and High Dimensional Expanders and Spectral Theory Beyond Graphs programs, including time for exercises which are available in the PDF below. The choice of which program goes...
This month, we sat down for a conversation with the newest member of our leadership team, Senior Scientist Jason Lee. Jason is an Associate Professor of EECS and Statistics at UC Berkeley. His research interests are in the theory of machine learning, optimization, and statistics. He has been participating in Simons Institute programs since we opened our doors in Fall 2013, when he was a graduate student.