| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1710400 | Applied Mathematics Letters | 2007 | 4 Pages |
Abstract
We show that the communication complexity of the parity of the sum of binary digits of x+yx+y is at least 0.085667…n+O(1)0.085667…n+O(1) where xx and yy are nn-bit integers. We also obtain a nontrivial (but weaker) lower bound on the parity of the total number of prime divisors of x+yx+y counted with multiplicity.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Igor E. Shparlinski,