BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Science and Engineering
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20251110T120000
DTEND;TZID=Asia/Kolkata:20251110T130000
DTSTAMP:20261011T123839
CREATED:20251104T161156Z
LAST-MODIFIED:20251104T161156Z
UID:2181-1762776000-1762779600@homecse.iitd.ac.in
SUMMARY:Non-Closure properties in algebraic complexity by Dr. Prateek Dwivedi
DESCRIPTION:Venue: Bharti501\n\nAbstract: A central question in algebraic complexity theory is understanding the behaviour of polynomial computation models under basic algebraic operations. While closure under addition and multiplication holds for most of the standard models like algebraic circuits\, closure under factorisation remains subtle. In this talk\, we will discuss a new result which proves that the well-studied model called read-once oblivious algebraic branching programs (roABPs) is not closed under factoring. This offers a contrasting perspective in light of the recent breakthrough work that proved a unified framework for analysing closure under factorisation. We will also discuss similar non-closure properties of roABP under other natural operations such as powering and symmetric composition. \nThis is based on joint work with Andrews\, Armand\, Hansen\, Limaye\, Srinivasan\, and Tavenas. \n[arxiv]
URL:https://homecse.iitd.ac.in/event/non-closure-properties-in-algebraic-complexity-by-dr-prateek-dwivedi/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
END:VEVENT
END:VCALENDAR