On Unapproximable Versions of $NP$-Complete Problems (Q5691296)
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: On Unapproximable Versions of $NP$-Complete Problems |
scientific article; zbMATH DE number 971586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Unapproximable Versions of $NP$-Complete Problems |
scientific article; zbMATH DE number 971586 |
Statements
On Unapproximable Versions of $NP$-Complete Problems (English)
0 references
9 June 1997
0 references
NP-complete problems
0 references
