On Hardness of Approximating the Parameterized Clique Problem (Q2800551): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2840728.2840733 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2295669206 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:39, 19 March 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
