An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem |
scientific article; zbMATH DE number 5073091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem |
scientific article; zbMATH DE number 5073091 |
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
0.886341392993927
0 references
0.8526304960250854
0 references
0.8503857851028442
0 references
