2 citations · 5 across the 14 of their papers we have counts for
1 paper · 1 filter
Holger Petersen
We investigate the complexity of algorithms counting ones in different sets of operations. With addition and logical operations (but no shift) O(log2(n)) steps suffice to count…