A lower time bound for the knapsack problem on random access machines (Q1052091)
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: A lower time bound for the knapsack problem on random access machines |
scientific article; zbMATH DE number 3814969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower time bound for the knapsack problem on random access machines |
scientific article; zbMATH DE number 3814969 |
Statements
A lower time bound for the knapsack problem on random access machines (English)
0 references
1983
0 references
random access machines
0 references
computational model
0 references
decision tree arguments
0 references
linear decision trees
0 references
