Completeness in approximation classes beyond APX (Q2503307)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5054301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness in approximation classes beyond APX |
scientific article; zbMATH DE number 5054301 |
Statements
Completeness in approximation classes beyond APX (English)
0 references
14 September 2006
0 references
complexity
0 references
NP-optimization problems
0 references
polynomial approximation
0 references
reductions
0 references
completeness
0 references
0 references
0 references
0 references
0 references
0.8981393
0 references
0.8804594
0 references
