Bounded-Search-Trees

• Parameterized Complexity: FPT, the W-Hierarchy, Kernelization, and Bounded Search Trees · 2019-05-11

  An in-depth exploration of parameterized complexity theory—how structural parameters beyond input size can tame NP-hardness through FPT algorithms, kernelization, and the W-hierarchy.