Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458)
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: Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems |
scientific article; zbMATH DE number 6590799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems |
scientific article; zbMATH DE number 6590799 |
Statements
Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (English)
0 references
9 June 2016
0 references
approximation
0 references
computational complexity
0 references
combinatorial problems
0 references
0 references
