On Hardness of Approximating the Parameterized Clique Problem (Q2800551): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:13, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Hardness of Approximating the Parameterized Clique Problem |
scientific article |
Statements
On Hardness of Approximating the Parameterized Clique Problem (English)
0 references
15 April 2016
0 references
clique
0 references
fixed parameter tractability
0 references
hardness of approximation
0 references
parameterized complexity
0 references
