# Timeline for Is the following special case of multiway number partitioning NP-hard?

### Current License: CC BY-SA 4.0

6 events
when toggle format what by license comment
Jan 14 at 6:59 comment Thank you so much for the solultion. I should have come with that.
Jan 14 at 4:21 comment To extend @Gamow's observation, the straightforward dynamic program for a problem with element universe $U = \{0,1,...,u\}$ has running time $O(nku^{k-1})$. When $u=1$, the only truly expensive part of the algorithm drops out.
Jan 14 at 0:10 comment Nice first question! Welcome to our community!
Jan 13 at 17:02 comment Since all input numbers are $0$ or $1$, such a partition exists if and only if $(\sum a_i)/k$ is an integer. This is trivial to check in polynomial time.
S Jan 13 at 16:49 review
Jan 14 at 0:11
S Jan 13 at 16:49 history asked