Number Balancing is as hard as Minkowski's Theorem and Shortest Vector

Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss +1

The number balancing (NBP) problem is the following: given real numbers $a_1,\dots ,a_n\in [0,1]$, find two disjoint subsets $I_1,I_2\subseteq [n]$ so that the difference $|\sum_…