An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2005.09.026 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2005.09.026 / rank | |||
Normal rank | |||
Latest revision as of 05:24, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem |
scientific article |
Statements
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (English)
0 references
15 November 2006
0 references
subset-sum problem
0 references
Knapsack problem
0 references
parallel algorithms
0 references
PRAM machines
0 references
