–
Coffee and Check-in
–
Beating Brute Force Search for Compression Problems
Ryan Williams (Massachusetts Institute of Technology)
–
Break
–
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle
Rahul Ilango (MIT)
–
Lunch (on your own)
–
Planted Clique Conjectures are Equivalent
Shuichi Hirahara (National Institute of Informatics, Tokyo)
–
One Way Functions and Zero Knowledge
Mikito Nanashima (Tokyo Institute of Technology)
–
Break
–
Partial Minimum Branching Program Size Problem is ETH-hard
Ludmila Glinskih (Boston University)
–
Every Optimal Circuit for Parity Partitions into a Binary Tree
Marco Carmosino (IBM)
–
Reception
–
Coffee and Check-in
–
TFNP and Cryptography: An Interplanetary Tour of Impagliazzo's Worlds
Daniel Mitropolsky (Columbia University)
–
Break
–
Kolmogorov comes to Cryptomania
Marshall Ball (NYU)
–
Lunch (on your own)
–
On SNARGs, Propositional Proofs, and Local Satisfiability
Alex Lombardi (Princeton University)
–
Break
–
A Direct PRF Construction from Kolmogorov Complexity
Yanyi Liu (Cornell University)
–
Coffee and Check-in
–
Meta-Mathematics of Complexity Theory
Igor Carboni Oliveira (University of Warwick)
–
Break
–
A Feasibly Constructive Proof of the Schwartz-Zippel Lemma
Albert Atserias (UPC Barcelona)
–
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
Iddo Tzameret (Imperial College London)
–
Lunch (on your own)
–
PPP is Not Turing-Closed in the Black Box Setting
Robert Robere (McGill University)
–
Break
–
Quantum Automating TC⁰-Frege Is LWE-Hard
Noel Arteche (Lund University)
–
Coffee and Check-in
–
Polynomial-time Pseudo-deterministic Construction of Primes
Hanlin Ren (University of Oxford)
–
Break
–
New Circuit Lower Bounds Via Solving Range Avoidance
Lijie Chen (UC Berkeley)
–
Lunch (on your own)
–
Strong vs. Weak Range Avoidance and the Linear Ordering Principle
Oliver Korten (Columbia University)
–
Break
–
Opening up the Distinguisher
Roei Tell (University of Toronto)
–
Boosting Simple Learners Smoothly
Russell Impagliazzo (UC San Diego)