Strong computational lower bounds via parameterized complexity (Q856413): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong computational lower bounds via parameterized complexity |
scientific article |
Statements
Strong computational lower bounds via parameterized complexity (English)
0 references
7 December 2006
0 references
parameterized computation
0 references
computational complexity
0 references
lower bound
0 references
clique
0 references
polynomial time approximation scheme
0 references
