A Non-Oblivious Reduction of Counting Ones to Multiplication

preprint2015arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

A Non-Oblivious Reduction of Counting Ones to Multiplication

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0