Addition Chains with Multiplicative Cost,

reportActive / Technical Report | Accession Number: ADA021587 | Need Help?

Abstract:

If each step in an addition chain is assigned a cost equal to the product of the numbers added at that step, binary addition chains are shown to minimize total cost.

Author(s):
Graham, R. L. ; Yao, A. C-c. ; Yao, F-f.
Author Organization(s):
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Supplementary Note:
Prepared in cooperation with Bell Labs., Murray Hill, N.J., Massachusetts Inst. of Tech., Cambridge, and Brown Univ., Providence, R.I.
Pagination:
0009

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
STAN-CS-76-540
Contract/Grant Number(s):
N00014-67-A-0112-0057, NSF-DCR72-03752-A02
Project Number(s):
NR-044-402
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*COMPUTATIONS, *ADDITION, ALGORITHMS, COMPUTER PROGRAMMING, CHAINS
Field(s)/Group(s):
Theoretical Mathematics, Computer Programming and Software
Report Date:
1976 Jan 01