Conference paper
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
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
Rie Kubota Ando
CoNLL 2006
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996