An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:23, 5 March 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
