Year: 2011
Type: preprint
Abstract: We investigate the complexity of algorithms counting ones in different sets of operations. With addition and logical operations (but no shift) $O(\log^2(n))$ steps suffice to count ones. Parity can be computed with complexity $O(\log(n))$, which is the same bound as for methods using shift-operations. If multiplication is available, a solution of time complexity $O(\log^*(n))$ is possible improving the known bound $O(\log\log(n))$.
Source: arXiv (Cornell University)
Author: Petersen, Holger
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1674933202