Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • I tried dynamic programming before but till now I am only able to count number of sub sequences but unable to trace the sequence back. Is it possible to trace the sequence through it ? Commented Jun 15, 2013 at 16:36
  • To be completely honest, I don't know but I don't think so. Sorry if that wasn't clear, but that's why I merely said "see" if you can modify it. Commented Jun 15, 2013 at 16:40
  • This is not a "variant" of the subset sum problem, it is the subset sum problem. The wikipedia lists various algorithms. Commented Jun 15, 2013 at 17:15
  • 2
    No the subset-sum problem is a decision problem, it asks if there is a subset, not for all of the subsets. These are different problems, but obviously extremely closely related. Commented Jun 15, 2013 at 17:50
  • 1
    "Obviously that's exponential" - All solutions that generate a complete solution to this problem will be exponential, unless P = NP, so there's really no reason not to use brute force, unless you are looking for a fast way to get an approximate solution, or more restrictions are put on the input. Commented Jun 15, 2013 at 21:12