Probabilistic analysis of the subset-sum problem

Abstract Two linear time algorithms are shown to solve the n -object SUBSET-SUM problem with probability approaching 1 as n gets large, for a uniform instance distribution. Precise evaluations of the probabilities involved are given.