–
Coffee and Check-In
–
Opening Remarks
–
Intro to Meta-Complexity: Part 1
Rahul Santhanam (University of Oxford)
–
Break
–
Intro to Meta-Complexity: Part 2
Rahul Santhanam (University of Oxford)
–
Lunch
–
The Power of Distinguishing Simple From Random (Part I)
Valentine Kabanets (Simon Fraser University)
–
Break
–
The Power of Distinguishing Simple From Random (Part II)
Valentine Kabanets (Simon Fraser University)
–
Reception
–
Coffee and Check-In
–
Kolmogorov Complexity for Meta-Complexity Theoreticians
Eric Allender (Rutgers University)
–
Break
–
Probabilistic Kolmogorov Complexity
Igor Carboni Oliveira (University of Warwick)
–
Lunch
–
The Quest for Hardness of Meta-Complexity: Progress, Barriers, and Next Steps (Part I)
Rahul Ilango (MIT)
–
Break
–
The Quest for Hardness of Meta-Complexity: Progress, Barriers, and Next Steps (Part II)
Rahul Ilango (MIT)
–
Coffee and Check In
–
Cryptography and Kolmogorov Complexity (Part I)
Rafael Pass (Tel-Aviv University and Cornell Tech)
–
Break
–
Cryptography and Kolmogorov Complexity (Part II)
Rafael Pass (Tel-Aviv University and Cornell Tech)
–
Lunch
–
Minimal Complexity Assumptions for Cryptography (Part I)
Tal Malkin (Columbia University)
–
Break
–
Minimal Complexity Assumptions for Cryptography (Part II)
Tal Malkin (Columbia University)
–
Coffee and Check In
–
Proof Complexity & Meta-Complexity Tutorial
Toniann Pitassi (University of Toronto)
–
Break
–
Lunch
–
Proofs, Circuits and Total Search Problems
Susanna de Rezende (Lund University)
–
Break
–
Automatability: The Proof Search Problem
Susanna de Rezende (Lund University)