Strong computational lower bounds via parameterized complexity (Q856413)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5078609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong computational lower bounds via parameterized complexity |
scientific article; zbMATH DE number 5078609 |
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
0 references
0.9549105763435364
0 references
0.8958283066749573
0 references
0.7861819863319397
0 references
0.7841396331787109
0 references
0.7821488976478577
0 references
