Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Foucaud, Florent; Galby, Esther; Khazaliya, Liana; Li, Shaohua; Inerney, Fionn Mc; Sharma, Roohani; Tale, Prafullkumar

Journal title: International Colloquium on Automata, Languages and Programming, ICALP 2024

Journal number: 2

Journal publisher: Dagstuhl Publishing

Published year: 2024

DOI identifier: 10.48550/arxiv.2307.08149