A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A lower bound for integer multiplication on randomized ordered read-once branching programs
2003
Information and Computation
We prove an exponential lower bound 2 (n/ log n) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized one-way communication complexity of certain Boolean functions. It generalizes to some other models of randomized branching programs. In contrast, we prove that testing integer multiplication, contrary even to a nondeterministic situation, can be computed by randomized ordered
doi:10.1016/s0890-5401(03)00118-4
fatcat:hk36x4iylzbrdd4e5dt2lfiwoi