Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm

Abstract

SummaryIn 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.