BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1357
DTSTAMP:20231116T105051Z
SUMMARY:The power of regular and permutation branching programs
DESCRIPTION:Speaker: Hari Krishnan P A (TIFR)\n\nAbstract: \nBranching prog
 rams are computational models which are similar to finite automata. They a
 re particularly interesting because popular pseudorandom generators can fo
 ol certain classes of branching programs. In this talk\, we will see a few
  restricted classes of branching programs\, i.e.\, regular and permutation
  branching programs\, and how effective they are in simulating other branc
 hing programs. All the results are taken from here: https://eccc.weizmann
 .ac.il/report/2023/102/\n
URL:https://www.tcs.tifr.res.in/web/events/1357
DTSTART;TZID=Asia/Kolkata:20231117T160000
DTEND;TZID=Asia/Kolkata:20231117T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR