Timeline for Solving the Knapsack problem in $O(v^*n^2)$, where $v^*$ is the maximum value of all $n$ items
Current License: CC BY-SA 4.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2018 at 16:05 | history | answered | Sudix | CC BY-SA 4.0 |