Equal-Subset-Sum Faster Than the Meet-in-the-Middle

Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz +1

In the Equal-Subset-Sum problem, we are given a set $S$ of $n$ integers and the problem is to decide if there exist two disjoint nonempty subsets $A,B\subseteq S$, whose elements…