BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/682
DTSTAMP:20230914T125934Z
SUMMARY:Parallelization of Boolean Groebner Basis Algorithm
DESCRIPTION:Speaker: Varun Narayanan\n\nAbstract: \nGroebner basis for a mu
 ltivariate polynomial ideal is a finite basis of polynomials that has many
  useful properties. Large memory requirements and computation time for mos
 t practical problems hinder the use of Groebner basis in many areas. Distr
 ibuting the memory over many cores will take care of the large memory requ
 irements of the algorithm. In this talk we discuss one approach to paralle
 l implementation of Buchberger's algorithm for computing the basis for boo
 lean polynomials with efficient memory usage without considering the compu
 tation time. We propose improvements on the data structure\, Zero Suppress
 ed Decision Diagram\, to facilitate efficient storage as well as communica
 tion of polynomials among multiple cores. The code is implemented using Op
 enMPI in C++ and is compared with PolyBoRi package in Sage.\n
URL:https://www.tcs.tifr.res.in/web/events/682
DTSTART;TZID=Asia/Kolkata:20160510T160000
DTEND;TZID=Asia/Kolkata:20160510T173000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR