Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 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.
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Imran Nasim, Melanie Weber
SCML 2024
Ira Pohl
Artificial Intelligence
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025