Timeline for Complexity of a knapsack variant
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3, 2017 at 21:10 | comment | added | Royi | @Bangye, Any chance you have a look at this - math.stackexchange.com/questions/2415617? Thank You. | |
| Jan 8, 2015 at 12:18 | comment | added | Bangye | 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. | |
| Jan 8, 2015 at 9:11 | comment | added | user1742364 | 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. | |
| Jan 7, 2015 at 23:21 | history | answered | Bangye | CC BY-SA 3.0 |