YoVDO

Pseudorandomness

Offered By: Simons Institute via YouTube

Tags

Theoretical Computer Science Courses High Dimensional Expanders Courses

Course Description

Overview

Explore cutting-edge research in pseudorandomness through a series of conference talks from ITCS 2021. Delve into topics such as explicit SoS lower bounds from high-dimensional expanders, block rigidity and its implications for Turing machine lower bounds, pseudorandom generators for unbounded-width permutation branching programs, computational entropies below majority, and shrinkage under random projections with cubic formula lower bounds in AC^0. Gain insights from leading researchers in theoretical computer science as they present their latest findings and advancements in the field of pseudorandomness.

Syllabus

Pseudorandomness


Taught by

Simons Institute

Related Courses

Approximation Algorithms Part I
École normale supérieure via Coursera
Approximation Algorithms Part II
École normale supérieure via Coursera
Automata Theory
Stanford University via edX
Computation in Complex Systems
Santa Fe Institute via Complexity Explorer
Computing: Art, Magic, Science
ETH Zurich via edX