BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1087
DTSTAMP:20230914T125950Z
SUMMARY:Hardness Characterisations and Size-Width Lower Bounds for QBF Reso
 lution
DESCRIPTION:Speaker: Meena Mahajan (IMSc\, Chennai)\n\nAbstract: \nThis tal
 k will start with an overview of the relatively young field of QBF proof c
 omplexity\, explaining the QBF proof system QURes\, and an assessment of e
 xisting lower bound techniques. In the main part of the talk\, I will desc
 ribe a characterisation of QURes proof size in terms of a model in circuit
  complexity called term decision lists\, yielding very direct connections 
 between circuit lower bounds and QURes proof size lower bounds. Joint work
  with Olaf Beyersdorff\, Joshua Blinkhorn\, Tomáš Peitl.\nYouTube Live :
  https://www.youtube.com/watch?v=Zn7ZzaELF6A\n
URL:https://www.tcs.tifr.res.in/web/events/1087
DTSTART;TZID=Asia/Kolkata:20200929T160000
DTEND;TZID=Asia/Kolkata:20200929T170000
END:VEVENT
END:VCALENDAR