Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
Paper
On the Time Required to Perform Multiplication
Abstract
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.
Related
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
Christopher Lohse, Adrian Selk, et al.
NeurIPS 2025
Vinayak Gupta, Rajmohan C, et al.
ICON 2022