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 - The Fusion of Science and Community**

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

Loading...

Similar Threads - SUBSET problem solved | Date |
---|---|

I A problem in combinatorics | Jan 17, 2018 |

B Dimension of subset containing two circles | May 11, 2017 |

I If set A subset of B, and B of C, it does not necessarilly f | Nov 4, 2016 |

I Why is the empty set a proper subset of every set? | Sep 16, 2016 |

A null set is a subset of every set | May 26, 2014 |

**Physics Forums - The Fusion of Science and Community**