• 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)
–
Break
–
The KRW Conjecture: Results and Open Problems
Or Meir (University of Haifa)
–
Pseudorandom Generators from Polarizing Random Walks
Kaave Hosseini (UC San Diego)
–
Lunch
–
Oracle Separation of BQP and the Polynomial Hierarchy
Avishay Tal (UC Berkeley)
–
Break
–
Lower Bounds for Unrestricted Boolean Circuits: Open Problems
Sasha Kulikov (St. Petersburg Department of Steklov Institute of Mathematics)
–
Static Data Structure Lower Bounds Imply Rigidity
Sasha Golovnev (Columbia University)
–
Coffee and Check-In
–
Lifting Nullstellensatz Degree to Monotone Span Program Size
Robert Robere (McGill University)
–
Break
–
Algorithmic Polynomials
Sasha Sherstov (UCLA)
–
Approximate Degree and Quantum Query Lower Bounds via Dual Polynomials
Mark Bun (Princeton University)
–
Lunch
–
BPP Lifting and Its Applications
Toni Pitassi (University of Toronto)
–
Break
–
Monotone Circuit Lower Bounds from Resolution (Now with Applications!)
Mika Göös (Harvard University), Mika Göös (Harvard University)
–
Locating Linear Decision Lists within TC^0
Meena Mahajan (Institute of Mathematical Sciences)
–
Reception
–
Coffee and Check-In
–
An Overview of Quantified Derandomization
Roei Tell (Weizmann Institute)
–
Break
–
Clique Is Hard on Average for Regular Resolution
Susanna de Rezende (Czech Academy of Sciences)
–
Fooling Polytopes
Li-Yang Tan (Stanford University)
–
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)
–
Break
–
Hardness Magnification
Igor Carboni Oliveira (University of Warwick)
–
Natural Properties, MCSP, and Proving Circuit Lower Bounds
Valentine Kabanets (Simon Fraser University)
–
Lunch
–
A Review of Some Recent Lower Bounds Against Low-Depth Threshold Circuits
Ryan Williams (Massachusetts Institute of Technology)
–
Recent Structure Lemmas for Depth-two Threshold Circuits
Lijie Chen (UC Berkeley)
–
Break
–
New Lower Bounds Through an Improved Easy WItness Lemma
Cody Murray (Massachusetts Institute of Technology)
–
Boolean Matrix Multiplication Lower Bounds
Michal Koucky (Charles University)
–
Coffee and Check-In
–
The Pathset Approach to Formula Lower Bounds
Benjamin Rossman (University of Toronto)
–
Distribution-Free Junta Testing
Rocco Servedio (Columbia University)
–
Break
–
The Complexity of Distributions
Emanuele Viola (Northeastern University)
–
Lunch
–
Does Looking Inside a Circuit Help?
Antonina Kolokolova (Memorial University of Newfoundland)
–
The Coin Problem and AC^0[parity]
Srikanth Srinivasan (Indian Institute of Technology Bombay)
–
A Short List of Equalities Has Large Sign Rank
Arkadev Chattopadhyay (Tata Institute of Fundamental Research)