# Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector

• 1322 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 10328)

## Abstract

The number balancing (NBP) problem is the following: given real numbers $$a_1,\ldots ,a_n \in [0,1]$$, find two disjoint subsets $$I_1,I_2 \subseteq [n]$$ so that the difference $$|\sum _{i \in I_1}a_i - \sum _{i \in I_2}a_i|$$ of their sums is minimized. An application of the pigeonhole principle shows that there is always a solution where the difference is at most $$O(\frac{\sqrt{n}}{2^n})$$. Finding the minimum, however, is NP-hard. In polynomial time, the differencing algorithm by Karmarkar and Karp from 1982 can produce a solution with difference at most $$n^{-\varTheta (\log n)}$$, but no further improvement has been made since then.

In this paper, we show a relationship between NBP and Minkowski’s Theorem. First we show that an approximate oracle for Minkowski’s Theorem gives an approximate NBP oracle. Perhaps more surprisingly, we show that an approximate NBP oracle gives an approximate Minkowski oracle. In particular, we prove that any polynomial time algorithm that guarantees a solution of difference at most $$2^{\sqrt{n}}/2^{n}$$ would give a polynomial approximation for Minkowski as well as a polynomial factor approximation algorithm for the Shortest Vector Problem.

### Keywords

• Theoretical Computer Science
• Number Balance
• Pigeonhole Principle
• Symmetric Convex Body
• Minkowski Problem

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

T. Rothvoss—Supported by NSF grant 1420180 with title “Limitations of convex relaxations in combinatorial optimization”, an Alfred P. Sloan Research Fellowship and a David and Lucile Packard Foundation Fellowship.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
• DOI: 10.1007/978-3-319-59250-3_21
• Chapter length: 13 pages
• Readable on all devices
• Own it forever
• Exclusive offer for individuals only
• Tax calculation will be finalised during checkout
eBook
USD   64.99
Price excludes VAT (USA)
• ISBN: 978-3-319-59250-3
• Readable on all devices
• Own it forever
• Exclusive offer for individuals only
• Tax calculation will be finalised during checkout
Softcover Book
USD   84.99
Price excludes VAT (USA)

## Notes

1. 1.

SVP can be defined for any norm, but anywhere the norm is not specified we consider the Euclidean norm.

2. 2.

If $$\rho \le 2-\varepsilon$$, then one can still obtain an error of $$|\sum _{i=1}^n a_ix_i| \le 2^{-\varTheta (\varepsilon n)}$$, but this breaks down if $$\rho \ge 2$$.

3. 3.

We assume K is given to us by a separation oracle.

4. 4.

Here we ignore the dependence of t on n - notice that t is nondecreasing in n, so replacing t(n) by $$t(\sqrt{n})$$ only increases $$f_t(n)$$.

5. 5.

Strictly speaking, the length of axis i is $$2\lambda _i$$, but we will continue calling $$\lambda _i$$ the “axis length”.

6. 6.

Note that there exists an ellipsoid that approximates K within a factor of $$\sqrt{n}$$ and if K is a polytope with m facets, then this ellipsoid can be found in time polynomial in n and m. However, if one only has a separation oracle for K, then the best factor achievable in polynomial time is n [GLS12].

## References

1. Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the 28th STOC, pp. 99–108. ACM (1996)

2. Aharonov, D., Regev, O.: Lattice problems in NP cap conp. J. ACM 52(5), 749–765 (2005)

3. Bohman, T.: A sum packing problem of erdös and the conway-guy sequence. Proc. AMS 124(12), 3627–3636 (1996)

4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1997)

5. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, vol. 2, pp. 122–125. Springer, Heidelberg (2012)

6. Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors, pp. 469–477 (2007)

7. John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays Presented to R. Courant on his 60th Birthday, 8 January 1948, pp. 187–204. Interscience Publishers Inc., New York (1948)

8. Karmarkar, N., Karp, R.: The differencing method of set partitioning. Technical report, CS Division, UC Berkeley (1982). http://digitalassets.lib.berkeley.edu/techreports/ucb/text/CSD-83-113.pdf

9. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)

10. Lenstra, A., Lenstra, H., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515–534 (1982)

11. Lovász, L.: An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM (1986)

12. Lovász, L.: Geometric Algorithms and Algorithmic Geometry. American Mathematical Society (1990)

13. Lunnon, W.: Integer sets with distinct subset-sums. Math. Comput. 50(181), 297–320 (1988)

14. Lev, V., Yuster, R.: On the size of dissociated bases. Electr. J. Comb. 18(1), P117 (2011)

15. Matousek, J.: Lectures on Discrete Geometry. Springer, New York (2002)

16. Mertens, S.: The easiest hard problem: number partitioning. Comput. Complex. Stat. Phys. 125(2), 125–139 (2006)

17. Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post-quantum Cryptography, pp. 147–191. Springer (2009)

18. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley Inc., New York (1990)

19. Nguyen, P., Vallée, B.: The lll algorithm. In: Nguyen, P., Vallée, B. (eds.) Information Security and Cryptography. Springer, Heidelberg (2010)

20. Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498–532 (1994)

21. Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201–224 (1987)

22. Woeginger, G., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299–302 (1992)

## Author information

Authors

### Corresponding author

Correspondence to Rebecca Hoberg .

## Rights and permissions

Reprints and Permissions

© 2017 Springer International Publishing AG

### Cite this paper

Hoberg, R., Ramadas, H., Rothvoss, T., Yang, X. (2017). Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector. In: Eisenbrand, F., Koenemann, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2017. Lecture Notes in Computer Science(), vol 10328. Springer, Cham. https://doi.org/10.1007/978-3-319-59250-3_21