A Subexponential Reduction from Product Partition to Subset Sum
<|reference_start|>A Subexponential Reduction from Product Partition to Subset Sum: In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the product of the numbers not in the subset. Our approach is to obtain the integer factorization of each number. This is the subexponential step. We then form a matrix with the exponents of the primes and show that the PPP has a solution iff some Subset Sum Problems have a common solution. Finally, using the fact that the exponents are not large we combine all the Subset Sum Problems in a single Subset Sum Problem (SSP) and show that its size is polynomial in $m,n$. We show that the PPP has a solution iff the final SSP has one.<|reference_end|>
@article{costandin2024a,
    title={A Subexponential Reduction from Product Partition to Subset Sum},
    author={Marius Costandin},
    journal={arXiv preprint arXiv:2405.12555},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.12555},
    primaryClass={math.CO cs.CC}
}