Conference paper
Toward Scientific Workflows in a Serverless World
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022
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
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Kaiyuan Zhang, Guanhong Tao, et al.
ICLR 2023