An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1781876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An alternative to Ben-Or's lower bound for the knapsack problem complexity |
scientific article; zbMATH DE number 1781876 |
Statements
An alternative to Ben-Or's lower bound for the knapsack problem complexity (English)
0 references
15 August 2002
0 references
algebraic complexity of the knapsack problem
0 references
0.797980546951294
0 references
