Timeline for Show $0-1$ Knapsack is polynomially reducible to this problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2017 at 13:52 | vote | accept | Kuifje | ||
| Feb 7, 2017 at 13:52 | comment | added | Kuifje | Thanks. So after all the problem is not NP-hard! | |
| Feb 7, 2017 at 1:51 | history | answered | Thomas Kalinowski | CC BY-SA 3.0 |