Pseudorandomness For Unbounded Width Branching

12th Innovations in Theoretical Computer Science Conference (ITCS 2021) http://itcs-conf.org/

Edward Pyne (Harvard University) https://kyng.inf.ethz.ch/acseminar/talk.html?id=2021-12-16_pyne.

This work is about how finding efficient ways to stretch a small random string into a long string that cannot be distinguished from ...

Explicit SoS lower bounds from high-dimensional expanders Irit Dinur (Weizmann Institute of Science), Yuval Filmus (Technion), ...

http://www.math.ias.edu/seminars/abstract?event=129025 More videos on http://video.ias.edu.

Avi Wigderson Institute for Advanced Study December 3, 2008 For more videos, visit http://video.ias.edu.

Computational Complexity Conference 2021.

RANDOM: Fourier growth of regular branching programs

Near-Optimal Derandomization of Medium-

Russell Impagliazzo Institute for Advanced Study December 3, 2008 For more videos, visit http://video.ias.edu.

David Conlon, University of Oxford https://simons.berkeley.edu/talks/

Luca Trevisan, UC Berkeley https://simons.berkeley.edu/talks/fundamental-techniques-in-

Instructor: Ramprasad Saptharishi Agenda: [Explicit expander constructions] Analysis of the zig-zag product, construction of ...