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

Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang. Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. In Friedrich Eisenbrand, Jochen Könemann, editors, Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings. Volume 10328 of Lecture Notes in Computer Science, pages 254-266, Springer, 2017. [doi]

Abstract

Abstract is missing.