Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds
DOI:
https://doi.org/10.7146/brics.v4i12.18803Resumé
We show that on a RAM with addition, subtraction, bitwiseBoolean operations and shifts, but no multiplication, there is a
trans-dichotomous solution to the static dictionary problem using
linear space and with query time sqrt(log n(log log n)^(1+o(1))). On
the way, we show that two w-bit words can be multiplied in
time (log w)^(1+o(1)) and that time Omega(log w) is necessary, and that
Theta(log log w) time is necessary and sufficient for identifying the
least significant set bit of a word.
Downloads
Publiceret
1997-01-12
Citation/Eksport
Brodnik, A., Miltersen, P. B., & Munro, J. I. (1997). Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds. BRICS Report Series, 4(12). https://doi.org/10.7146/brics.v4i12.18803
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).