es of algorithms etc. <span class="math notranslate nohighlight">\(O(n)\)</span></p></li>
</ul>
</li>
<li><p><a class="reference external" href="https://www.researchgate.net/profile/Michael_Fellows/publication/2376092_Parameterized_Complexity/links/5419e9240cf25ebee98883da/Parameterized-Complexity.pdf">Parameterized complexity</a> (Downey and Fellows)</p>
<ul>
<li><p>want to solve problems that are NP-hard or worse, so we isolate input into a parameter</p></li>
</ul>
</li>
</ul>
</section>
<section id="baye