An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints (Q3813600)
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 4083362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints |
scientific article; zbMATH DE number 4083362 |
Statements
An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints (English)
0 references
1988
0 references
geometric complexity type proof
0 references
knapsack problem
0 references
side constraint
0 references
0.7840737700462341
0 references
