Vitaly Feldman
JMLR
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
Yale Song, Zhen Wen, et al.
IJCAI 2013
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019