@Article{husfeldt_et_al:DagRep.3.8.40,
author = {Husfeldt, Thore and Paturi, Ramamohan and Sorkin, Gregory B. and Williams, Ryan},
title = {{Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)}},
pages = {40--72},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {3},
number = {8},
editor = {Husfeldt, Thore and Paturi, Ramamohan and Sorkin, Gregory B. and Williams, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.8.40},
URN = {urn:nbn:de:0030-drops-43422},
doi = {10.4230/DagRep.3.8.40},
annote = {Keywords: Algorithms, exponential time algorithms, exact algorithms, computational complexity, satisfiability}
}