%0 Conference Paper %1 conf/stacs/AustrinKKN16 %A Austrin, Per %A Kaski, Petteri %A Koivisto, Mikko %A Nederlof, Jesper %B STACS %D 2016 %E Ollinger, Nicolas %E Vollmer, Heribert %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 13:1-13:14 %T Dense Subset Sum May Be the Hardest. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2016.html#AustrinKKN16 %V 47 %@ 978-3-95977-001-9

@inproceedings{conf/stacs/AustrinKKN16, added-at = {2018-08-23T00:00:00.000+0200}, author = {Austrin, Per and Kaski, Petteri and Koivisto, Mikko and Nederlof, Jesper}, biburl = {https://www.bibsonomy.org/bibtex/207f7ad486e8f0f69fbdee468d9288c8a/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2016}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2016.13}, interhash = {4b639a30bf64656d3b92ddf370497ea4}, intrahash = {07f7ad486e8f0f69fbdee468d9288c8a}, isbn = {978-3-95977-001-9}, keywords = {dblp}, pages = {13:1-13:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:51.000+0100}, title = {Dense Subset Sum May Be the Hardest.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2016.html#AustrinKKN16}, volume = 47, year = 2016 }