Parallel time and space upper-bounds for the subset-sum problem (Q955010)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel time and space upper-bounds for the subset-sum problem |
scientific article |
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
