BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/5
DTSTAMP:20230914T125906Z
SUMMARY:Kolmogorob Complexity
DESCRIPTION:Speaker: Satyadev Nandakumar\nIowa State University\nUSA\nhttp:
 //www.cs.iastate.edu/~satyadev\n\nAbstract: \nUsing Kolmogorob Complexity\
 , we will prove that there exist an oracle with respect to which $P$ not e
 qual to $NP$.\n
URL:https://www.tcs.tifr.res.in/web/events/5
DTSTART;VALUE=DATE:20090612
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR