https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL780 2026-04-09T06:01:00Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL780&diff=1660&oldid=prev 2026-03-04T10:14:59Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL780<br /> | name = parameterized Algorithms for Np-hard problems<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = MTL342 or COL351 or equivalent<br /> | overlaps = <br /> }}<br /> <br /> == MTL780 : parameterized Algorithms for Np-hard problems ==<br /> 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.</div>

Prashantt492