Observations on optimal parallelizations of two-list algorithm (Q991072): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel two-list algorithm for the knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comments on parallel algorithms for the knapsack problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem / rank | |||
Normal rank | |||
Latest revision as of 04:20, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Observations on optimal parallelizations of two-list algorithm |
scientific article |
Statements
Observations on optimal parallelizations of two-list algorithm (English)
0 references
2 September 2010
0 references
knapsack problem
0 references
subset-sum problem
0 references
parallel algorithm
0 references
two-list algorithm
0 references
