Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11390-005-0003-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11390-005-0003-7 / rank | |||
Normal rank | |||
Latest revision as of 08:24, 19 December 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
0 references
0 references
0 references
