Tight Cell-Probe Bounds for Online Hamming Distance Computation
From MaRDI portal
Publication:5741756
DOI10.1137/1.9781611973105.48zbMath1421.68256arXiv1207.1885OpenAlexW2951655572MaRDI QIDQ5741756
Markus Jalsenius, Benjamin Sach, Raphaël Clifford
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1885
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)