Exponential Lower Bounds on a Class of Knapsack Algorithms (Q3960469)
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: Exponential Lower Bounds on a Class of Knapsack Algorithms |
scientific article; zbMATH DE number 3782738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential Lower Bounds on a Class of Knapsack Algorithms |
scientific article; zbMATH DE number 3782738 |
Statements
Exponential Lower Bounds on a Class of Knapsack Algorithms (English)
0 references
1981
0 references
exponential lower bounds
0 references
nonexistence of polynomial knapsack algorithm
0 references
algorithms having restricted access to the input
0 references
greedy algorithm
0 references
NP- hardness
0 references
computational complexity
0 references
