Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized computation and complexity: a new approach dealing with NP-hardness |
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
