In this paper we first give a uniform AC^0 algorithm which uses
partial sums to compute multiple addition. Then we use it to show
that multiple addition is computable in uniform TC^0 by using
count only once sequentially. By constructing bit matrix for
multiple addition, ... more >>>