In the Subset Sum problem, we are given n integers a_1,...,a_n and a target number t, and are asked to find the subset of the a_i's such that the sum is t. A version of the subset sum problem is the Random Modular Subset Sum problem. In this version, the ... more >>>