BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1514
DTSTAMP:20250901T061310Z
SUMMARY:Fast parallel algebraic algorithms for some algebraic problems
DESCRIPTION:Speaker: Varun Ramanathan (TIFR)\n\nAbstract: \nOne of the earl
 iest known algorithms is Euclid's algorithm for computing the greatest com
 mon divisor of two natural numbers. This algorithm also extends to univari
 ate polynomials. The algorithm is fast\, but sequential in nature. In this
  talk\, we will see some efficient parallel algorithms (via the notion of 
 constant-depth arithmetic circuits) for some polynomial algebra problems\,
  including the GCD. An important idea here is an efficient way to go betwe
 en two well-known representations for symmetric polynomials -- the element
 ary symmetric polynomials and the power sum polynomials.The talk will be b
 ased on the paper "Constant-Depth Arithmetic Circuits for Linear Algebra P
 roblems" by Robert Andrews and Avi Wigderson.\n
URL:https://www.tcs.tifr.res.in/web/events/1514
DTSTART;TZID=Asia/Kolkata:20250110T160000
DTEND;TZID=Asia/Kolkata:20250110T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR