Question: Show that the SUBSET-SUM problem is solvable in polynomial time if the input is given in a unary encoding. That is, show that SUBSET-SUM is
Show that the SUBSET-SUM problem is solvable in polynomial time if the input is given in a unary encoding. That is, show that SUBSET-SUM is not strongly NP-hard. What is the running time of your algorithm?
Step by Step Solution
3.35 Rating (164 Votes )
There are 3 Steps involved in it
TLDR If you have an instance of Subset Sum writing it in unary will not help you solve it an... View full answer
Get step-by-step solutions from verified subject matter experts
