An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096100178 / rank | |||
Normal rank | |||
Revision as of 19:10, 19 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
