Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets

@inproceedings{Cardinal2021ModularSS,
  title={Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets},
  author={Jean Cardinal and John Iacono},
  booktitle={SOSA},
  year={2021}
}
The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \pmod{m}$, and to report such a set if it exists. We give a simple $O(m \log m)$-time with high probability (w.h.p.) algorithm for the modular subset sum problem. This builds on and improves on a previous $\tilde{O}(m)$ w.h.p. algorithm from Axiotis, Backurs, Jin, Tzamos, and Wu (SODA 19… 

Figures from this paper

Faster Deterministic Modular Subset Sum
TLDR
A simple data structure, designed specifically to handle the text problem that arises in the algorithms for Modular Subset Sum, is developed, which provides both a hashing-based and a deterministic variant of the shift-trees.
Faster Deterministic Modular Subset Sum
TLDR
A simple data structure, designed specifically to handle the text problem that arises in the algorithms for Modular Subset Sum, is developed, which is a simple variant of a segment tree and provides both a hashing-based and a deterministic variant of the shift-trees.
Classical and quantum dynamic programming for Subset-Sum and variants
TLDR
A novel dynamic programming data structure is introduced with applications to Subset-Sum and a number of variants, including Equal-Sums, where one seeks two disjoint subsets with the same sum, and an O(2) quantum algorithm for Shifted-Sum, an improvement on the best known O( 2) classical running time.
Fast n-fold Boolean Convolution via Additive Combinatorics
TLDR
A deterministic or randomized o(nk) algorithm running in almost linear time with respect to the input plus output size k is presented, and a new deterministic almost linear output-sensitive algorithm for non-negative sparse convolution is presented.
Knapsack and Subset Sum with Small Items
TLDR
These algorithms work for the more general problem variants with multiplicities, where each input item comes with a (binary encoded) multiplicity, which succinctly describes how many times the item appears in the instance.

References

SHOWING 1-10 OF 54 REFERENCES
Fast Modular Subset Sum using Linear Sketching
TLDR
This paper presents an algorithm running in time O~(m), which matches a recent conditional lower bound of [Abboud et al.'17] based on the Strong Exponential Time Hypothesis, and is able to simulate the "textbook" Dynamic Programming algorithm much faster, using ideas from linear sketching.
Faster Pseudopolynomial Time Algorithms for Subset Sum
TLDR
A series of new algorithms are presented that compute and return all the realizable subset sums up to the integer u in Õ(min { √nu,u5/4,σ }), where σ is the sum of all elements of S and Õ hides polylogarithmic factors.
Optimal Dynamic Strings
TLDR
This paper presents an efficient data structure for maintaining a dynamic collection of strings under the following operations, and proves that even if the only possible query is checking equality of two strings, either updates or queries take amortized $\Omega(\log n)$ time; hence the implementation is optimal.
New Tight Bounds on Uniquely Represented Dictionaries
We present a solution to the dictionary problem where each subset of size $n$ of an ordered universe is represented by a unique structure, containing a (unique) binary search tree. The structure
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees
TLDR
The B-skip-list is introduced, which has most of the guarantees of the B-treap, but is vastly simpler and easier to implement.
Zero-sum problems - A survey
  • Y. Caro
  • Mathematics
    Discret. Math.
  • 1996
B-Treaps: A Uniquely Represented Alternative to B-Trees
TLDR
This work presents the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a Btreap, which has depth $O(\log_{\ensuremath{B}} n)$, uses linear space with high probability, and supports efficient one-dimensional range queries.
Zero-sum sets of prescribed size
Erdős, Ginzburg and Ziv proved that any sequence of 2n−1 integers contains a subsequence of cardinality n the sum of whose elements is divisible by n. We present several proofs of this result,
Randomized search trees
TLDR
A randomized strategy for maintaining balance in dynamically changing search trees that has optimalexpected behavior, and generalizes naturally to weighted trees, where the expected time bounds for accesses and updates again match the worst-case time bounds of the best deterministic methods.
Pattern matching in dynamic texts
TLDR
A data structure that supports insertions and deletions of characters and movements of arbitrary large blocks within a text in O(log~nloglognlog*n) time per operation and an ingredient in the solution is a data structure for the dynamic string equality problem introduced by Mehlhorn, Sundar and Uhrig.
...
1
2
3
4
5
...