Question: Let UNARY-SSUM be the subset sum problem in which all numbers are represented in unary. Why does the NP-completeness proof for SUBSET-SUM fail to show
Let UNARY-SSUM be the subset sum problem in which all numbers are represented in unary. Why does the NP-completeness proof for SUBSET-SUM fail to show UNARY-SSUM is NP complete? Show that UNARY-SSUM ∈ P.
Step by Step Solution
★★★★★
3.44 Rating (167 Votes )
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
The crux of the question is that we measure complexity as a function from the size of the input to t... View full answer
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
