MTL780: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 3 | | credits = 3 | ||
| credit_structure = 3-0-0 | | credit_structure = 3-0-0 | ||
| pre_requisites = MTL342 or COL351 or equivalent | | pre_requisites = [[MTL342]] or [[COL351]] or equivalent | ||
| overlaps = | | overlaps = | ||
}} | }} | ||
Latest revision as of 16:43, 14 April 2026
| MTL780 | |
|---|---|
| parameterized Algorithms for Np-hard problems | |
| Credits | 3 |
| Structure | 3-0-0 |
| Pre-requisites | MTL342 or COL351 or equivalent |
| Overlaps | |
MTL780 : parameterized Algorithms for Np-hard problems
Review of NP-completeness and reductions. Introduction to parameterized complexity, parameterized algorithms through bounded search trees, iterative compression, randomized methods in parameterized algorithms, dynamic programming over subsets, treewidth and parameterized algorithms for bounded treewidth graphs, algebraic techniques in parameterized complexity, Matroids and representative sets, lower bounds for parameterized algorithms based on Exponential Time Hypothesis and Strong Exponential Time Hypothesis.