Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors

DOI10.1145/3406325.3451024arXiv2010.08576OpenAlexW3172442290WikidataQ112313929 ScholiaQ112313929MaRDI QIDQ6065284

Karol Węgrzycki, Jesper Nederlof

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.08576

zbMATH Keywords

knapsacksubset sumspace complexitymeet-in-the-middlerepresentation technique

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Computing generalized convolutions faster than brute force ⋮ Moderate exponential-time algorithms for scheduling problems

This page was built for publication: Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors