Lower Bounds and Trade-offs in Proof Complexity
Lower Bounds and Trade-offs in Proof Complexity
Tid: Fr 2019-06-14 kl 14.00
Plats: Kollegiesalen, KTH, Brinellvägen 8, 100 44 Stockholm
Ämnesområde: Datalogi
Respondent: Susanna Figueiredo De Rezende , Teoretisk datalogi
Opponent: Professor Amit Chakrabarti, Dartmouth College, Hanover, New Hampshire, USA
Handledare: Associate Professor Jakob Nordström