Go to the corresponding LIPIcs Volume Portal 
Chen, Xi ; Jin, Yaonan ; Randolph, Tim ; Servedio, Rocco A.
pdfformat: 

@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:139:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18864}, URN = {urn:nbn:de:0030drops188641}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.39}, annote = {Keywords: Exact algorithms, subset sum, log shaving} }
Keywords:  Exact algorithms, subset sum, log shaving  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 