The Subset Sum Problem: Input: a finite subset S of integers, and an integer t. Question: does there exist a subset A ⊆ S such that the members of A sum to t? Suppose you have access to an oracle that answers queries about instances of Subset Sum. Assuming (S, t) is a positive instance of Subset Sum, provide an algorithm for determining the set A whose members sum to t. Your algorithm should make at most a polynomial number (as a function of |S|) of oracle queries to compute A.
Asked
Active
Viewed 84 times
1
-
1What would be your programming-related question? – Martin B. Dec 06 '19 at 22:02
-
Its a complexity related question – Joy Dec 06 '19 at 22:19
-
It’s not appropriate for this site. – Simon Wright Dec 09 '19 at 08:59