Shyam Marjit, Harshit Singh, et al.
WACV 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
Rudra M. Tripathy, Amitabha Bagchi, et al.
Intelligent Data Analysis
Workshop paper
Large Language Model Evaluation on Financial Benchmarks
Bing Zhang, Mikio Takeuchi, et al.
ICAIF 2024
Tessa Lau
AI Magazine