Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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 Sciences
Identifiers
URN: urn:nbn:se:kth:diva-167392DOI: 10.4230/LIPIcs.STACS.2015.48Scopus ID: 2-s2.0-84923924069ISBN: 9783939897781 (print)OAI: oai:DiVA.org:kth-167392DiVA: diva2:814485
Conference
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, 4 March 2015 through 7 March 2015
Funder
Swedish Research Council, 621-2012-4546
Note

QC 20150527

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

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Austrin, Per

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 38 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf