Hardness of approximation for knapsack problems (Q2345987)
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: Hardness of approximation for knapsack problems |
scientific article; zbMATH DE number 6440994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximation for knapsack problems |
scientific article; zbMATH DE number 6440994 |
Statements
Hardness of approximation for knapsack problems (English)
0 references
29 May 2015
0 references
computational complexity
0 references
knapsack problem
0 references
subset-sum
0 references
exponential-time hypothesis
0 references
PRAM without bit operations
0 references
algebraic-circuit lower-bounds
0 references
hardness of approximation
0 references
0 references
0 references
0.803449809551239
0 references
0.7979529500007629
0 references
0.7943631410598755
0 references
0.7886059284210205
0 references
0.7886059284210205
0 references
