Subset Sum in the Absence of Concentration
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2015
Major/Subject
Mcode
Degree programme
Language
en
Pages
48-61
Series
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany
Description
VK: Kaski, P.; HIIT; TAPEASE
Keywords
additive combinatorics, exponential-time algorithm, homomorphic hashing, Littlewood--Offord problem, subset sum
Other note
Citation
Austrin, P, Kaski, P, Koivisto, M & Nederlof, J 2015, Subset Sum in the Absence of Concentration . in E W Mayr & N Ollinger (eds), 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany . Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 48-61, Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 04/03/2015 . https://doi.org/10.4230/LIPIcs.STACS.2015.48