Like the comment above yours says there are algorithms for SSP that are polynomial in the target value of the sum. For values on the order of something someone

Like the comment above yours says there are algorithms for SSP that are polynomial in the target value of the sum. For values on the order of something someone would buy with a credit card I think they should be practical. See: https://en.wikipedia.org/wiki/Subset_sum_problem#Pseudo-polynomial_time_dynamic_programming_solution https://en.wikipedia.org/wiki/Subset_sum_problem#Pseudo-poly... The problem only becomes really difficult when the numbers are so large that it takes a large number of bits to represent them.