Volume 3404 of the series Lecture Notes in Computer Science pp 305-314
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
- Abraham D. FlaxmanAffiliated withDepartment of Mathematical Sciences, Carnegie Mellon University
- , Bartosz PrzydatekAffiliated withDepartment of Computer Science, ETH Zurich
Abstract
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is a classic NP-hard problem. The hardness of SSP varies greatly with the density of the problem. In particular, when m, the logarithm of the largest input number, is at least c · n for some constant c, the problem can be solved by a reduction to finding a short vector in a lattice. On the other hand, when \(m=\mathcal{O}(log n)\) the problem can be solved in polynomial time using dynamic programming or some other algorithms especially designed for dense instances. However, as far as we are aware, all known algorithms for dense SSP take at least Ω(2 m ) time, and no polynomial time algorithm is known which solves SSP when m = ω(log n) (and m = o(n)).
We present an expected polynomial time algorithm for solving uniformly random instances of the subset sum problem over the domain ℤ M , with \(m=\mathcal{O}((log n)^{2})\). To the best of our knowledge, this is the first algorithm working efficiently beyond the magnitude bound of \(\mathcal{O}(log n)\), thus narrowing the interval of hard-to-solve SSP instances.
- Title
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
- Book Title
- STACS 2005
- Book Subtitle
- 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005. Proceedings
- Pages
- pp 305-314
- Copyright
- 2005
- DOI
- 10.1007/978-3-540-31856-9_25
- Print ISBN
- 978-3-540-24998-6
- Online ISBN
- 978-3-540-31856-9
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 3404
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Volker Diekert (16)
- Bruno Durand (17)
- Editor Affiliations
-
- 16. Universität Stuttgart, FMI
- 17. LIF, CNRS & Univ. de Provence,
- Authors
-
- Abraham D. Flaxman (18)
- Bartosz Przydatek (19)
- Author Affiliations
-
- 18. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA
- 19. Department of Computer Science, ETH Zurich, 8092, Zurich, Switzerland
Continue reading...
To view the rest of this content please follow the download PDF link above.