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.

3
  • $\begingroup$ Thanks for the answer. Unfortunately, I must disagree. Since we are dealing with an integer knapsack problem rather than the traditional 0/1-knapsack problem, the table size is bounded by $P \cdot n \cdot (n \cdot K)$, where $K := \max_i k_i$. Note that nethier $K$, nor $P$ are polynomially bounded. Your suggested DP only works in polynomial time if $K$ is polynomially bounded as well, as noted in my second remark above. $\endgroup$ Commented Jan 8, 2015 at 9:11
  • $\begingroup$ OK, sorry I did not notice that. It seems to me your question is more difficult than the usual questions in this forum. Maybe you can try to ask it in Theoretic Computer Science of StackExchange. $\endgroup$ Commented Jan 8, 2015 at 12:18
  • $\begingroup$ @Bangye, Any chance you have a look at this - math.stackexchange.com/questions/2415617? Thank You. $\endgroup$ Commented Sep 3, 2017 at 21:10