Knapsack problem can be solved by Dynamic Programming, which looks like to be solved in polynomial time. However, it is
Posted: Mon Jun 06, 2022 6:47 pm
Knapsack problem can be solved by Dynamic Programming, which
looks like to be solved in polynomial time. However, it is weird if
the Knapsack problem is solved in polynomial time, since it is
NP-Complete.
Point a logical fault in this discussion.
looks like to be solved in polynomial time. However, it is weird if
the Knapsack problem is solved in polynomial time, since it is
NP-Complete.
Point a logical fault in this discussion.