We study the following problem. Given a multiset $M$ of non-negative integers, decide whether there exist and, in positive case, compute two non-trivial multisets whose Minkowski sum is equal to $M$. The A and B containing all possible sums any element B. This problem was proved be NP-complete when are replaced by sets. version strictly related factorization boolean polynomials that turns out a...