Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as well as multiplication modulo N, is derived and it is shown that these lower bounds can be approached. Then a lower bound on the amount of time required to perform the most significant part of multiplication (xy/N) is derived. © 1967, ACM. All rights reserved.
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
Yuta Tsuboi, Yuya Unno, et al.
AAAI 2011
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Arnold L. Rosenberg
Journal of the ACM