Parallel time and space upper-bounds for the subset-sum problem

Three new parallel scalable algorithms for solving the Subset-Sum Problem in time and O(n+c) space in the PRAM model are presented, where n is the number of objects, c is the capacity, wmin is the smallest weight and p is the number of processors. These time and space bounds are better than the direct parallelization of Bellman’s algorithm, which was the most efficient known result.