Subset Sum in the Absence of Concentration

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

11 Citations (Scopus)
Original languageEnglish
Title of host publication32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany
EditorsErnst W. Mayr, Nicolas Ollinger
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Pages48-61
ISBN (Electronic)978-3-939897-78-1
DOIs
Publication statusPublished - 2015
MoE publication typeA4 Article in a conference publication
EventInternational Symposium on Theoretical Aspects of Computer Science - Garching, Germany
Duration: 4 Mar 20157 Mar 2015
Conference number: 32

Publication series

Name
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
ISSN (Electronic)1868-8969

Conference

ConferenceInternational Symposium on Theoretical Aspects of Computer Science
Abbreviated titleSTACS
CountryGermany
CityGarching
Period04/03/201507/03/2015

Keywords

  • additive combinatorics
  • exponential-time algorithm
  • homomorphic hashing
  • Littlewood--Offord problem
  • subset sum

Cite this