–
Coffee & Check-In
–
Opening Remarks
–
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
Yuval Dagan (MIT)
–
Quantum for Science
Jin-Peng Liu (UC Berkeley)
–
New Forms of Hardness versus Randomness
Lijie Chen (UC Berkeley)
–
Understanding the Role of Derandomization in TCS
Roei Tell (Weizmann Institute of Science)
–
The Power of Randomness in Kolmogorov Complexity
Zhenjian Lu (Simon Fraser University)
–
Break
–
Learning versus Proofs of Complexity Lower Boundes
Marco Carmosino (IBM Research)
–
Proof Complexity and TFNP
Robert Robere (McGill University)
–
Is Cryptography Feasible if P=NP?
Marshall Ball (New York University)
–
Emulating Non-Local Games with Cryptography
Alex Lombardi (UC Berkeley)