A Non-Oblivious Reduction of Counting Ones to Multiplication
classification
💻 cs.DS
keywords
onescountingmultiplicationnumberoperationsalgorithmavailablebinary
read the original abstract
An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.