Is it possible to show that the SUBSET-SUM problem can be solved in polynomial time if the target t is given in unary?(adsbygoogle = window.adsbygoogle || []).push({});

We know that the subset sum problem consist on finding a subset S' of numbers from a set S such that its sum equals t.

If t is unary, say if t=3 then t=111, how can we find a polynomial-time algorithm?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# SUBSET-SUM problem can be solved in polynomial time

**Physics Forums | Science Articles, Homework Help, Discussion**