A lower time bound for the knapsack problem on random access machines (Q1052091)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower time bound for the knapsack problem on random access machines |
scientific article |
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
