Jihun Yun, Peng Zheng, et al.
ICML 2019
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
L. Joskowicz, Elisha Sacks
aaai 1994
Arnold L. Rosenberg
Journal of the ACM
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022