Fast and simple modular subset sum

DOI10.1137/1.9781611976496.6MaRDI QIDQ6538743zbMATH OpenFDO

Authors Kyriakos Axiotis, Artūrs Bačkurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976496.6

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Minimizing tardy processing time on a single machine in near-linear time
• Minimizing tardy processing time on a single machine in near-linear time
• Almost optimum \(\ell \)-covering of \(\mathbb{Z}_n\)
• Fast n-fold Boolean convolution via additive combinatorics
• Knapsack and subset sum with small items
• Does subset sum admit short proofs?

This page was built for publication: Fast and simple modular subset sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538743)