by Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Reference:
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex CoverFlorent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Bibtex Entry:
@string{lipics="LIPIcs"}
@inproceedings{FoucaudGK0IST24,
author = {Florent Foucaud and
Esther Galby and
Liana Khazaliya and
Shaohua Li and
Fionn Mc Inerney and
Roohani Sharma and
Prafullkumar Tale},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {Problems in {NP} Can Admit Double-Exponential Lower Bounds When Parameterized
by Treewidth or Vertex Cover},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {66:1--66:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.66},
doi = {10.4230/LIPICS.ICALP.2024.66},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FoucaudGK0IST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org},
keywords = {ParAI,PGD}
}