Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


Computing when multiplications cost nothing

Author: D. J. Newman
Journal: Math. Comp. 46 (1986), 255-257
MSC: Primary 05A99; Secondary 11Y16
MathSciNet review: 815847
Full-text PDF Free Access

Abstract | Similar Articles | Additional Information

Abstract: A (rather strange) computer is considered which costs 1cent to perform each addition but costs nothing to perform a multiplication. It is shown that the addition chain from 1 to n cost maximally $ {(\operatorname{Log} n)^{1/2 + o(1)}}$ rather than the classical $ \sim \operatorname{Log} n$.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 05A99, 11Y16

Retrieve articles in all journals with MSC: 05A99, 11Y16

Additional Information

PII: S 0025-5718(1986)0815847-8
Article copyright: © Copyright 1986 American Mathematical Society