BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1742
DTSTAMP:20260707T040332Z
SUMMARY:Hard CNF Instances for Ideal Proof Systems
DESCRIPTION:Speaker: Shubham Bhardwaj (TIFR)\n\nAbstract: \nIn this talk\, 
 we will go over lower bounds for roABP-IPS refutations of Boolean CNF form
 ulas. Earlier IPS lower bounds were mostly known for algebraic systems of 
 equations\, rather than CNF formulas\, which are the standard objects in p
 ropositional proof complexity. We will discuss how the paper obtains such 
 lower bounds using a feasible interpolation argument\, where short roABP-I
 PS refutations would imply small monotone span programs for the correspond
 ing interpolants. Therefore\, lower bounds for monotone span programs can 
 be used to give lower bounds for roABP-IPS refutations.\n
URL:https://www.tcs.tifr.res.in/web/events/1742
DTSTART;TZID=Asia/Kolkata:20260710T160000
DTEND;TZID=Asia/Kolkata:20260710T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR