Hardness of approximation for knapsack problems (Q2345987)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of approximation for knapsack problems |
scientific article |
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
