Parallel time and space upper-bounds for the subset-sum problem (Q955010)
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: Parallel time and space upper-bounds for the subset-sum problem |
scientific article; zbMATH DE number 5368341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel time and space upper-bounds for the subset-sum problem |
scientific article; zbMATH DE number 5368341 |
Statements
Parallel time and space upper-bounds for the subset-sum problem (English)
0 references
18 November 2008
0 references
subset-sum problem
0 references
knapsack problem
0 references
parallel algorithms
0 references
dynamic programming
0 references
upper-bound complexity
0 references
0 references
0 references
0.886341392993927
0 references
0.834881067276001
0 references
0.8313215970993042
0 references
0.8103067874908447
0 references
