Faster Equal-Subset-Sum via Truncated Inclusion–ExclusionResearch Paper
Equal-Subset-Sum asks, given integers , for two distinct index sets with . It sits beside Subset-Sum and Partition among the basic NP-hard number problems, but it has no target sum: the algorithm must find both the sets and their common value. Its worst-case exponential running time has…