An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:50, 30 January 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
