Deterministic Linear-Time Modular Subset Sum
cs.DS
Submitted: 2026-09-25
Updated: 2026-11-01
Terminology
Sources
- Fast and Simple Modular Subset Sum
- Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets
- A quadratic lower bound for subset sums
- Finding a Solution to the Erd\H{o}s-Ginzburg-Ziv Theorem in Linear Time
- Finding a solution to the Erd\H{o}s-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
- Faster Deterministic Modular Subset Sum
- Olson's theorem for cyclic groups
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles