The inapproximability of non-NP-hard optimization problems. (Q1853546)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inapproximability of non-NP-hard optimization problems. |
scientific article |
Statements
The inapproximability of non-NP-hard optimization problems. (English)
0 references
21 January 2003
0 references
Computational complexity
0 references
Approximation hardness
0 references
Combinatorial optimization
0 references
Reductions
0 references
