Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
Project: LogiCS_at_TUWien
Updated at: 01-11-2024
Show more
information
Project acronym
LogiCS_at_TUWien