Dense Subset Sum May Be the Hardest

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

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

Original languageEnglish
Title of host publication33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
EditorsNicolas Ollinger, Heribert Vollmer
Number of pages13
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date2016
ISBN (Electronic)978-3-95977-001-9
DOIs
Publication statusPublished - 2016
MoE publication typeA4 Article in conference proceedings
EventSymposium on Theoretical Aspects of Computer Science - Orléans , France
Duration: 17 Feb 201620 Feb 2016
Conference number: 33

Publication series

NameLeibniz International Proceedings in Informatics
PublisherSchloss Dagstuhl, Leibniz-Zentrum für Informatik
Volume47
ISSN (Electronic)1868-8969

Fields of Science

  • 113 Computer and information sciences

Cite this