Timeline for Knapsack problem -- NP-complete despite dynamic programming solution?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 5, 2013 at 21:21 | answer | added | bcorso | timeline score: 44 | |
| Apr 2, 2012 at 15:22 | vote | accept | Strin | ||
| Apr 2, 2012 at 15:22 | vote | accept | Strin | ||
| Apr 2, 2012 at 15:22 | |||||
| Apr 1, 2012 at 16:16 | vote | accept | Strin | ||
| Apr 2, 2012 at 15:22 | |||||
| Apr 1, 2012 at 16:16 | vote | accept | Strin | ||
| Apr 1, 2012 at 16:16 | |||||
| Mar 31, 2012 at 7:13 | comment | added | Raphael | Keep in mind that DP is polynomial in the "table size". The table is exponentially large for Knapsack (see Kaveh's answer). | |
| Mar 31, 2012 at 7:11 | history | edited | Raphael | CC BY-SA 3.0 |
rephrased to sound less cranky
|
| Mar 31, 2012 at 6:54 | history | tweeted | twitter.com/#!/StackCompSci/status/185983337880485889 | ||
| Mar 31, 2012 at 6:07 | history | edited | Ran G. | CC BY-SA 3.0 |
title and tags
|
| Mar 31, 2012 at 6:01 | answer | added | Ran G. | timeline score: 7 | |
| Mar 31, 2012 at 5:52 | answer | added | Kaveh | timeline score: 47 | |
| Mar 31, 2012 at 5:44 | history | asked | Strin | CC BY-SA 3.0 |