Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:56, 7 February 2024
scientific article; zbMATH DE number 6979203
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal |
scientific article; zbMATH DE number 6979203 |
Statements
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (English)
0 references
13 November 2018
0 references
SETH
0 references
treewidth
0 references
lower bounds
0 references
