We give a randomised algorithm for Equal Subset Sum that, on $n$ arbitrary integers of at most $m\le2^n$ bits, runs in time $O\big((5/3)^n\mathrm{poly}(n)+n^2m\big)$, never outputs a non-solution, and outputs a solution with probability $1-2^{-Ω(n)}$ whenever one exists.

翻译：暂无翻译