Reductions, completeness and the hardness of approximability (Q2488898)
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: Reductions, completeness and the hardness of approximability |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reductions, completeness and the hardness of approximability |
scientific article |
Statements
Reductions, completeness and the hardness of approximability (English)
0 references
16 May 2006
0 references
Combinatorial optimization
0 references
Complexity theory
0 references
Computing science
0 references
\(\mathbf {NP}\)-hard optimization problems
0 references
Polynomial approximation
0 references
Approximation preserving reduction
0 references
Completeness in approximation classes
0 references
0 references
0 references
