Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1599636 |
||
| Property / author | |||
| Property / author: Jian'er Chen / rank | |||
Revision as of 18:52, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized computation and complexity: a new approach dealing with NP-hardness |
scientific article |
Statements
Parameterized computation and complexity: a new approach dealing with NP-hardness (English)
0 references
29 December 2005
0 references
computational complexity
0 references
NP-completeness
0 references
parameterized computation
0 references
approximation algorithms
0 references
