Lower Bounds and Trade-offs in Proof Complexity
Lower Bounds and Trade-offs in Proof Complexity
Time: Fri 2019-06-14 14.00
Location: Kollegiesalen, KTH, Brinellvägen 8, 100 44 Stockholm
Subject area: Computer Science
Doctoral student: Susanna Figueiredo De Rezende , Theoretical Computer Science
Opponent: Professor Amit Chakrabarti, Dartmouth College, Hanover, New Hampshire, USA
Supervisor: Associate Professor Jakob Nordström