BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/73
DTSTAMP:20230914T125909Z
SUMMARY:Introduction to Parameterized Complexity
DESCRIPTION:Speaker: Bodhayan Roy\nTata Institute of Fundamental Research\n
School of Technology and Computer Science\nHomi Bhabha Road\n\nAbstract: \
nFor problems that are NP hard\, till now we have nothing better than algo
rithms with exponential running times to obtain the optimal solution.\n\nH
owever\, if the time complexity of the algorithm has the form f(k).p(n) wh
ere k and n are output and input sizes respectively\, p(n) is a polynomial
over n\, and f is a function depending only on k\, then the algorithm per
forms efficiently over small values of k.\n\nProblems having such algorith
ms are said to be Fixed Parameter Tractable or in the class FPT. We will s
tudy some fixed-parameter algorithms for certain common NP hard problems (
this is in continuation of the talk given on 12/02/2010).\n
URL:https://www.tcs.tifr.res.in/web/events/73
DTSTART;VALUE=DATE:20100226
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR