BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1277
DTSTAMP:20230914T125957Z
SUMMARY:Determinantal complexity of the power sum polynomial
DESCRIPTION:Speaker: Varun Ramanathan\n\nAbstract: \nWe will introduce the 
 notion of determinantal complexity\, one of the main characters in the VP 
 vs VNP question\, which is the algebraic analogue of the P vs NP question.
  We will focus on a specific polynomial - the power sum polynomial - and s
 ee proof sketches for an upper bound and a lower bound on its determinanta
 l complexity. The lower bound will be from a paper by Alper\, Bogart and V
 elasco. Prerequisites for the talk are basic linear algebra (rank\, etc) a
 nd basic calculus (partial derivatives\, chain rule\, etc). There will be 
 some usage of tools from algebraic geometry but we won't see their proofs.
 \n
URL:https://www.tcs.tifr.res.in/web/events/1277
DTSTART;TZID=Asia/Kolkata:20230303T163000
DTEND;TZID=Asia/Kolkata:20230303T173000
LOCATION:A201
END:VEVENT
END:VCALENDAR