Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering
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
Joseph Y. Halpern, Yoram Moses
Journal of the ACM
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Ronald Fagin
Journal of the ACM