A nonlinear lower bound on linear search tree programs for solving knapsack-problems (Q1230654): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: David P. Dobkin / rank | |||
Property / author | |||
Property / author: David P. Dobkin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proving simultaneous positivity of linear forms / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:50, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A nonlinear lower bound on linear search tree programs for solving knapsack-problems |
scientific article |
Statements
A nonlinear lower bound on linear search tree programs for solving knapsack-problems (English)
0 references
1976
0 references