Go to the corresponding LIPIcs Volume Portal 
Austrin, Per ; Kaski, Petteri ; Koivisto, Mikko ; Nederlof, Jesper
pdfformat: 

@InProceedings{austrin_et_al:LIPIcs:2016:5714, author = {Per Austrin and Petteri Kaski and Mikko Koivisto and Jesper Nederlof}, title = {{Dense Subset Sum May Be the Hardest}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {13:113:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770019}, ISSN = {18688969}, year = {2016}, volume = {47}, editor = {Nicolas Ollinger and Heribert Vollmer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5714}, URN = {urn:nbn:de:0030drops57143}, doi = {10.4230/LIPIcs.STACS.2016.13}, annote = {Keywords: subset sum, additive combinatorics, exponentialtime algorithm, homomorphic hashing, littlewood–offord problem} }
Keywords:  subset sum, additive combinatorics, exponentialtime algorithm, homomorphic hashing, littlewood–offord problem  
Seminar:  33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)  
Issue Date:  2016  
Date of publication:  16.02.2016 