Constant approximating k-clique is w[1]-hard (Q6065290)
From MaRDI portal
!
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 7765284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant approximating k-clique is w[1]-hard |
scientific article; zbMATH DE number 7765284 |
Statements
Constant approximating k-clique is w[1]-hard (English)
0 references
14 November 2023
0 references
FPT-inapproximability
0 references
\(W[1]\)-hard
0 references
\(k\)-clique
0 references
\(k\)-vector-sum
0 references
