Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025
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
Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Rie Kubota Ando
CoNLL 2006