Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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
Conference paper
On Trajectory Augmentations for Off-Policy Evaluation
Ge Gao, Qitong Gao, et al.
ICLR 2024
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Conference paper
A Comparison of End-to-End Decision Forest Inference Pipelines
Hong Guan, Saif Masood, et al.
SoCC 2023