A Non-Oblivious Reduction of Counting Ones to Multiplication
Data Structures and Algorithms
2015-06-12 v1
Abstract
An algorithm counting the number of ones in a binary word is presented running in time where is the number of ones. The operations available include bit-wise logical operations and multiplication.
Keywords
Cite
@article{arxiv.1506.03473,
title = {A Non-Oblivious Reduction of Counting Ones to Multiplication},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1506.03473},
year = {2015}
}