The bit complexity of the predecessor problem
From MaRDI portal
Publication:287147
DOI10.1016/S0020-0190(97)00094-XzbMath1337.68121OpenAlexW2024331940MaRDI QIDQ287147
F. Blanchet-Sadri, M. Dambrine
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00094-x
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
This page was built for publication: The bit complexity of the predecessor problem