๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Sequences with Addition Chains

โœ Scribed by Downey, Peter; Leong, Benton; Sethi, Ravi


Book ID
118174076
Publisher
Society for Industrial and Applied Mathematics
Year
1981
Tongue
English
Weight
944 KB
Volume
10
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Addition chains with multiplicative cost
โœ R.L. Graham; A.C.-C. Yao; F.-F. Yao ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

If each step in an addition cl& is assigned a cos. equal to the product of the numbers at that step, "binary" addition chains are shown to mirdnke total cost. For a positive integer it, b:y a chain to n we mean a sequence C= ((a,, w, (a29 Q, -\* \* 3 (4, b,)) wuh ?re ak and bk are pC&iVe in@erS

Chain sequences with ordered enclosing
โœ T. A. Panyukova ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 232 KB
Symbolic computation with sequences
โœ M. Petkovลกek ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 198 KB