Efficient Randomized Algorithm for Subset Sum with Improved Time Complexity

We propose a randomized algorithm that solves the Subset Sum problem in pseudo-polynomial time O(n + √wt), where n is the number of input integers, w is the maximum integer, and t is the target sum. This improves upon the previous best algorithm with a time complexity of O(n + t).