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 OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4195944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving simultaneous positivity of linear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of additions in monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete linear proofs of systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound of the Number of Threshold Functions / rank
 
Normal rank

Latest revision as of 01:16, 13 June 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
    0 references
    0 references
    1978
    0 references
    0 references
    Knapsack Problem
    0 references
    Linear Search Tree Program
    0 references
    Lower Bound
    0 references
    0 references