Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Type
Liana Khazaliya
Liana Khazaliya is a Project Assistant at the Algorithms and Complexity Group.
Liana Khazaliya is a Project Assistant at the Algorithms and Complexity Group.