Let UNARY-SSUM be the subset sum problem in which all numbers are represented in unary. Why does

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 UNARY-SSUM is NP complete? Show that UNARY-SSUM ∈ P.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: