Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
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.
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
Imran Nasim, Melanie Weber
SCML 2024
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR
Tessa Lau
AI Magazine