2 papers
cs.DS2026
Pigeonhole Equal Subset Sum: Subexponential Algorithm, Tight Lower Bounds, and Average-Case Analysis
Deepak Bhati, Pranjal Dutta, Antoine Joux +2
The Equal Subset Sum problem asks, given n positive integers bounded by M, to find two distinct non-empty subsets with the same sum. We study this problem in the regime $M = 2^{o(n…
cs.DS2026
On the Largest Cardinality Subset Sum
Deepak Bhati, Anubhav Dhar, Pranjal Dutta +2
We study Largest Cardinality Subset Sum (LCSS): given nonnegative integers and a target , compute a subset summing to with maximum cardinality. We also consider its all-…