• Click on the titles of individual talks for abstract, slides and archived video.

–
Coffee and Check-In
–
Opening Remarks
–
Circuit Lower Bounds (and More) via the Fusion Method

Avi Wigderson (Institute for Advanced Study, Princeton)
Video
–
Break
–
The KRW Conjecture: Results and Open Problems

Or Meir (University of Haifa)
Video
–
Pseudorandom Generators from Polarizing Random Walks

Kaave Hosseini (UC San Diego)
Video
–
Lunch
–
Oracle Separation of BQP and the Polynomial Hierarchy

Avishay Tal (UC Berkeley)
Video
–
Break
–
Lower Bounds for Unrestricted Boolean Circuits: Open Problems

Sasha Kulikov (St. Petersburg Department of Steklov Institute of Mathematics)
Video
–
Static Data Structure Lower Bounds Imply Rigidity

Sasha Golovnev (Columbia University)
Video
–
Coffee and Check-In
–
Lifting Nullstellensatz Degree to Monotone Span Program Size

Robert Robere (McGill University)
Video
–
Break
–
Algorithmic Polynomials

Sasha Sherstov (UCLA)
Video
–
Approximate Degree and Quantum Query Lower Bounds via Dual Polynomials

Mark Bun (Princeton University)
Video
–
Lunch
–
BPP Lifting and Its Applications

Toni Pitassi (University of Toronto)
Video
–
Break
–
Monotone Circuit Lower Bounds from Resolution (Now with Applications!)

Mika Göös (Harvard University),
Mika Göös (Harvard University)
Video
–
Locating Linear Decision Lists within TC^0

Meena Mahajan (Institute of Mathematical Sciences)
Video
–
Reception
–
Coffee and Check-In
–
An Overview of Quantified Derandomization

Roei Tell (Weizmann Institute)
Video
–
Break
–
Clique Is Hard on Average for Regular Resolution

Susanna de Rezende (Czech Academy of Sciences)
Video
–
Fooling Polytopes

Li-Yang Tan (Stanford University)
Video
–
Lunch
–
Short Communications
–
Pseudorandom Generators from the Second Fourier Level (Pooya Hatami)
–
On Reducing Weight in Threshold Gates (Amir Yehudayoff)
–
The Complexity of Hazard-Free Circuits (Christian Ikenmeyer)
–
The Non-hardness of Approximating Circuit Size (Eric Allender)
–
Break
–
Open Problem Session
–
Coffee and Check-In
–
A Survey on MCSP

Rahul Santhanam (University of Oxford)
Video
–
Break
–
Hardness Magnification

Igor Carboni Oliveira (University of Warwick)
Video
–
Natural Properties, MCSP, and Proving Circuit Lower Bounds

Valentine Kabanets (Simon Fraser University)
Video
–
Lunch
–
A Review of Some Recent Lower Bounds Against Low-Depth Threshold Circuits

Ryan Williams (Massachusetts Institute of Technology)
Video
–
Recent Structure Lemmas for Depth-two Threshold Circuits

Lijie Chen (UC Berkeley)
Video
–
Break
–
New Lower Bounds Through an Improved Easy WItness Lemma

Cody Murray (Massachusetts Institute of Technology)
Video
–
Boolean Matrix Multiplication Lower Bounds

Michal Koucky (Charles University)
Video
–
Coffee and Check-In
–
The Pathset Approach to Formula Lower Bounds

Benjamin Rossman (University of Toronto)
Video
–
Distribution-Free Junta Testing

Rocco Servedio (Columbia University)
Video
–
Break
–
The Complexity of Distributions

Emanuele Viola (Northeastern University)
Video
–
Lunch
–
Does Looking Inside a Circuit Help?

Antonina Kolokolova (Memorial University of Newfoundland)
Video
–
The Coin Problem and AC^0[parity]

Srikanth Srinivasan (Indian Institute of Technology Bombay)
Video
–
A Short List of Equalities Has Large Sign Rank

Arkadev Chattopadhyay (Tata Institute of Fundamental Research)
Video