Organizers

    • Igor Carboni Oliveira
    • Rahul Santhanam

    • Contact

    Igor Carboni Oliveira

    Department of Computer Science, University of Oxford, Wolfson Building OX1 3QD

    Contributed Talks

    Clique is Hard on Average for Regular Resolution  [abstract] [slides]
    Ilario Bonacina (UPC)

     Pseudo-deterministic Proofs  [abstract] [slides]
    Dhiraj Holden (MIT)

     An Overview of Quantified Derandomization  [abstract] [slides]
    Roei Tell (Weizmann)

     Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources  [abstract] [slides]
    Alex Bredariol Grilo (CWI)

     An Upper Bound on the GKS Game via Max Bipartite Matching  [abstract] [slides]
    DeVon Ingram (Georgia Tech)

     Extractor-Based Time-Space Lower Bounds for Learning  [abstract] [slides]
    Sumegha Garg (Princeton)

     On the Extension Complexity of Polytopes Associated with Permutation Groups  [abstract] [slides]
    Mateus de Oliveira Oliveira (Bergen)

     Some Subsystems of Constant-Depth Frege with Parity  [abstract] [slides]
    Michal Garlik (UPC)

    [ Template adapted from HTML5webtemplates.co.uk ]