Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover

Esther Galby
Liana Khazaliya
Shaohua Li
Fionn Mc Inerney
Roohani Sharma
Prafullkumar Tale
Fichier non déposé

Dates et versions

hal-04631780 , version 1 (02-07-2024)

Identifiants

Citer

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, et al.. Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover. Proceedings of the 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024), Jul 2024, Talinn, Estonia. pp.66:1-66:19, ⟨10.4230/LIPIcs.ICALP.2024.66⟩. ⟨hal-04631780⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More