Space-efficient randomized algorithms for k-sum
From MaRDI portal
Space-efficient randomized algorithms for \(k\)-sum
Recommendations
- Deterministic time-space trade-offs for k-SUM
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Faster space-efficient algorithms for subset sum and k-sum
- Space-time tradeoffs for subset sum: an improved worst case algorithm
- Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
Cited in
(16)- Space-efficient algorithms for longest increasing subsequence
- Efficient dissection of bicomposite problems with cryptanalytic applications
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2
- Space-efficient algorithms for longest increasing subsequence
- Deterministic time-space trade-offs for k-SUM
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Faster space-efficient algorithms for subset sum and k-sum
- A subquadratic algorithm for 3XOR
- Improved space-time tradeoffs for \(k\)SUM
- On Multidimensional and Monotone k-SUM
- Space-time tradeoffs for subset sum: an improved worst case algorithm
- A Space Efficient Algorithm for the Calculation of the Digit Distribution in the Kolakoski Sequence
- Algorithms and Computation
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs
- Fine-grained complexity in a world without cryptography
This page was built for publication: Space-efficient randomized algorithms for \(k\)-sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921466)