@InProceedings{chen_et_al:LIPIcs.APPROX/RANDOM.2023.39,
author = {Chen, Xi and Jin, Yaonan and Randolph, Tim and Servedio, Rocco A.},
title = {{Subset Sum in Time 2^\{n/2\} / poly(n)}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {39:1--39:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.39},
URN = {urn:nbn:de:0030-drops-188641},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.39},
annote = {Keywords: Exact algorithms, subset sum, log shaving}
}