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 positive integers, and fix an among them. We show that if the binary representation of consists of blocks of zeros and ones, then addition by 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 . Our result implies that powering by composed of many blocks require exponential-size, bounded-depth arithmetic circuits over .
Recommendations
- The Hamming weight of the non-adjacent-form under various input statistics
- On the number of carries occurring in an addition mod \(2^k -1\)
- scientific article; zbMATH DE number 5968524
- On the distribution of low Hamming weight sequence
- Impact of the Hamming weight of the difference of two random variables on the probability of its preservation after addition and subtraction
Cited in
(3)
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)