Space-Efficient Randomized Algorithms for K-SUM
From MaRDI portal
Publication:2921466
DOI10.1007/978-3-662-44777-2_67zbMath1425.68453OpenAlexW2400482671MaRDI QIDQ2921466
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_67
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Randomized algorithms (68W20)
Related Items
Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2, Space-Efficient Algorithms for Longest Increasing Subsequence, Universal Hashing via Integer Arithmetic Without Primes, Revisited, Unnamed Item, A subquadratic algorithm for 3XOR, Space-efficient algorithms for longest increasing subsequence, Efficient dissection of bicomposite problems with cryptanalytic applications, Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems