Fast Modular Subset Sum using Linear Sketching

DOI10.1137/1.9781611975482.4zbMath1431.68134arXiv1807.04825OpenAlexW2884311720MaRDI QIDQ5236185

Ce Jin, Christos Tzamos, Artūrs Bačkurs, Hongxun Wu, Kyriakos Axiotis

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (4)

Scheduling lower bounds via AND subset sum ⋮ The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Integer factorization as subset-sum problem ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum

This page was built for publication: Fast Modular Subset Sum using Linear Sketching