Counting Ones Without Broadword Operations
Computational Complexity
2016-01-19 v2
Abstract
A lower time bound for counting the number of ones in a binary input word of length is presented, where is the number of ones. The operations available are increment, decrement, bit-wise logical operations, and assignment. The only constant available is zero. An almost matching upper bound is also obtained.
Cite
@article{arxiv.1511.05210,
title = {Counting Ones Without Broadword Operations},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1511.05210},
year = {2016}
}