A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q584276 |
||
| Property / author | |||
| Property / author: David P. Dobkin / rank | |||
Revision as of 11:42, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem |
scientific article |
Statements
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (English)
0 references
1978
0 references
Knapsack Problem
0 references
Linear Search Tree Program
0 references
Lower Bound
0 references
