Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
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.
Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
Matteo Baldoni, Nirmit Desai, et al.
AAMAS 2009
Rocco Langone, Carlos Alzate, et al.
SSCI 2013
Chen-Yong Cher, Michael Gschwind
VEE 2008