Preliminary Program

- The workshop starts at 10am, and each talk is 25 minutes. Lunch is not provided. 
- Slides and abstracts from all talks are available here.

10:00:  Ilario Bonacina: "Clique is Hard on Average for Regular Resolution"
10:30:  Dhiraj Holden: "Pseudo-deterministic Proofs"

11:00-11:30:  Tea/Coffee

11:30:  Michal Garlik: "Some Subsystems of Constant-Depth Frege with Parity"
12:00:  DeVon Ingram: "An Upper Bound on the GKS Game via Max Bipartite Matching"

12:30-2:30:  Lunch Break

2:30:  Roeil Tell: "An Overview of Quantified Derandomization"
3:00:  Alex Bredariol Grilo: "Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources"

3:30-4:00:  Tea/Coffee

4:00:  Mateus de Oliveira Oliveira: "On the Extension Complexity of Polytopes Associated with Permutation Groups"
4:30:  Sumegha Garg: "Extractor-Based Time-Space Lower Bounds for Learning"

5:00:  Concluding Remarks


[ Template adapted from HTML5webtemplates.co.uk ]