Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
On the Time Required to Perform Addition
Journal of the ACM (JACM)
ELM-A Fast Addition Algorithm Discovered by a Program
IEEE Transactions on Computers
The Time Required for Group Multiplication
Journal of the ACM (JACM)
Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
A Survey of Parallel Machine Organization and Programming
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Toward an automata theory of brains
Communications of the ACM
The entropic limitations on VLSI computations(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The relationship between computational circuit complexity and radix
MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
On the problem of computational time and complexity of arithmetic functions
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On the computation time of certain classes of boolean functions
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
On the Time Necessary to Compute Switching Functions
IEEE Transactions on Computers
A Theory of Galois Switching Functions
IEEE Transactions on Computers
Combinational Circuit Synthesis with Time and Component Bounds
IEEE Transactions on Computers
B70-5 Theories of Abstract Automata
IEEE Transactions on Computers
On the Addition of Binary Numbers
IEEE Transactions on Computers
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Mathematical ``Lower Bounds'' and the Logic Circuit Designer
IEEE Transactions on Computers
Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits
IEEE Transactions on Computers
Engineering and scientific processing on the IBM 3090
IBM Systems Journal
On the computational complexity of finite functions and semigroup multiplication
Information Sciences: an International Journal
Parallelism and Array Processing
IEEE Transactions on Computers
| Hi-index | 0.06 |
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.