Change search
ReferencesLink to record
Permanent link

Direct link
Subset sum in the absence of concentration
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-8217-0158
2015 (English)In: Leibniz International Proceedings in Informatics, LIPIcs, 2015, 48-61 p.Conference paper (Refereed)
Abstract [en]

We study the exact time complexity of the Subset Sum problem. Our focus is on instances that lack additive structure in the sense that the sums one can form from the subsets of the given integers are not strongly concentrated on any particular integer value. We present a randomized algorithm that runs in O (20.3399nB4) time on instances with the property that no value can arise as a sum of more than B different subsets of the n given integers.

Place, publisher, year, edition, pages
2015. 48-61 p.
Keyword [en]
Additive combinatorics, Exponential-time algorithm, Homomorphic hashing, Littlewood-Offord problem, Subset sum, Exponential time algorithm, Set theory
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-167392DOI: 10.4230/LIPIcs.STACS.2015.48ScopusID: 2-s2.0-84923924069ISBN: 9783939897781OAI: diva2:814485
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, 4 March 2015 through 7 March 2015
Swedish Research Council, 621-2012-4546

QC 20150527

Available from: 2015-05-27 Created: 2015-05-22 Last updated: 2015-05-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Austrin, Per
By organisation
Theoretical Computer Science, TCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 34 hits
ReferencesLink to record
Permanent link

Direct link