Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Vanessa Lopez, Lam Thanh Hoang, et al.
Journal of Web Semantics
Akari Asai, Zeqiu Wu, et al.
ICLR 2024