Question: Show that the KNAPSACK problem is solvable in polynomial time if the input is given in a unary encoding. That is, show that KNAPSACK is
Show that the KNAPSACK problem is solvable in polynomial time if the input is given in a unary encoding. That is, show that KNAPSACK is not strongly NPhard. What is the running time of your algorithm?
Step by Step Solution
3.38 Rating (164 Votes )
There are 3 Steps involved in it
It is little tricky to get this idea Let me explain with an simple conversation between p1 and p2 p1 ... View full answer
Get step-by-step solutions from verified subject matter experts
