Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129952334, #quickstatements; #temporary_batch_1733743725753 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2800485060 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1007.5450 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129952334 / rank | |||
Normal rank | |||
Latest revision as of 12:32, 9 December 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
