Pages that link to "Item:Q955010"
From MaRDI portal
The following pages link to Parallel time and space upper-bounds for the subset-sum problem (Q955010):
Displaying 9 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)
- Simultaneous (poly-time, log-space) lower bounds (Q1102116) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Applications of mathematics to maritime search (Q2321650) (← links)
- (Q3746884) (← links)
- (Q3774941) (← links)