Birs- 20w5144: Proof Complexity

  1. Title:
    On 1-BP complexity of satisfiable Tseitin formulas and how it relates to regular resolution
    Speaker:
    Dmitry Itsykson

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231100-Itsykson.html

  2. Title:
    k-Clique and Regular vs. General Resolution
    Speaker:
    Shuo Pang

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231130-Pang.html

  3. Title:
    Exponential Resolution Lower Bounds for the Weak Pigeonhole Principle over Sparse Graphs
    Speaker:
    Kilian Risse

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231501-Risse.html

  4. Title:
    Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
    Speaker:
    Susanna de Rezende

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231601-deRezende.html

  5. Title:
    Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
    Speaker:
    Nicola Galesi

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231632-Galesi.html

  6. Title:
    Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
    Speaker:
    Alexander Knop

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001231704-Knop.html

  7. Title:
    Hard Examples for Common Variable Decision Heuristics
    Speaker:
    Marc Vinyals

    Link:
    http://www.birs.ca/events/2020/5-day-workshops/20w5144/videos/watch/202001240934-Vinyals.html