A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(78)90026-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2920901117 / rank | |||
Normal rank | |||
Revision as of 22:19, 19 March 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
