Integer addition and Hamming weight

From MaRDI portal
Publication:2830409




Abstract: We study the effect of addition on the Hamming weight of a positive integer. Consider the first 2n positive integers, and fix an alpha among them. We show that if the binary representation of alpha consists of Theta(n) blocks of zeros and ones, then addition by alpha causes a constant fraction of low Hamming weight integers to become high Hamming weight integers. This result has applications in complexity theory to the hardness of computing powering maps using bounded-depth arithmetic circuits over mathbbF2. Our result implies that powering by alpha composed of many blocks require exponential-size, bounded-depth arithmetic circuits over mathbbF2.









This page was built for publication: Integer addition and Hamming weight

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830409)