A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Dense Subset Sum May Be the Hardest

2016
*
Symposium on Theoretical Aspects of Computer Science
*

The Subset Sum problem asks whether a given set of n positive integers contains a subset of elements that sum up to a given target t. It is an outstanding open question whether the O * (2 n/2 )-time algorithm for Subset Sum by Horowitz and Sahni [J. ACM 1974] can be beaten in the worst-case setting by a "truly faster", O * (2 (0.5−δ)n )-time algorithm, with some constant δ > 0. Continuing an earlier work [STACS 2015], we study Subset Sum parameterized by the maximum bin size β, defined as the

doi:10.4230/lipics.stacs.2016.13
dblp:conf/stacs/AustrinKKN16
fatcat:xhlvjyiftvhnxg22jzm2epzvoy