A systolic algorithm for solving knapsack problems (Q4844566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207169408804335 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977515275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of dense linear systems on an optimal systolic architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for generating combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel generation of permutations on systolic arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient systolic algorithm for finding bridges in a connected graph / rank
 
Normal rank

Latest revision as of 17:01, 23 May 2024

scientific article; zbMATH DE number 790903
Language Label Description Also known as
English
A systolic algorithm for solving knapsack problems
scientific article; zbMATH DE number 790903

    Statements

    A systolic algorithm for solving knapsack problems (English)
    0 references
    0 references
    0 references
    27 August 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    systolic algorithm
    0 references
    0/1-knapsack problems
    0 references
    0 references