Answers are grounded in this paper and cite their sources.
Summary In the paper, we compute some lower bounds on time of parallel solving of the subset sum problem on a big number of processors by several versions of dynamic programming algorithm Balsub proposed before by Pisinger. Based on these lower bounds, we propose a version of Balsub which could be possibly effectively parallelized.
No takes yet. Share an insight, caveat, or question.
Kolpakov et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: