The following pages link to (Q3774941):
Displaying 5 items.
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)