Skip to main content
Computer Science

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*

6
  • $\begingroup$ 1. What's a "superincreasing combination of A"? 2. What is your question? What approaches have you already considered? Please edit the question to clarify. $\endgroup$ Commented Aug 17, 2022 at 21:42
  • $\begingroup$ What is a "combination of A"? Do you mean "subsequence"? $\endgroup$ Commented Aug 17, 2022 at 23:12
  • $\begingroup$ cs.stackexchange.com/tags/dynamic-programming/info $\endgroup$ Commented Aug 18, 2022 at 0:29
  • 1
    $\begingroup$ Also, note that if $A = \{1,2,4,8,...,2^k,...,2^n\}$ you can't do better than $\Omega(2^n)$. However, like @D.W. says, I believe that dynamic programming and memoization will give you optimal results. $\endgroup$ Commented Aug 18, 2022 at 13:59
  • $\begingroup$ By "combinations of A", do you mean "subsets of A"? $\endgroup$ Commented Sep 17, 2022 at 3:49