A study of some addition chain problems

In this paper, some mathematical properties of the shortest-length addition chain are found for certain integers whose binary patterns meet some special forms; and the correctness of these properties is proved.

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 22; no. 2; pp. 117 - 134
Main Authors:	Tsai, Y.H., Chin, Y.H.
Format:	Journal Article
Language:	English
Published:	Gordon and Breach Science Publishers 01.01.1987
Subjects:	Addition Chain big step double step F.1.3 [Complexity Classes]-relations among complexity measures F.2.1 [Numer-ical Algorithms and Problem Complexity]-number-theoretic computations F.l.l [Computation by Abstract Devices] G.l [Numerical Analysis]-Computer Arithmetic long-five Models of Computation-computability theory short-five small step special four the shortest-length addition chain
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper, some mathematical properties of the shortest-length addition chain are found for certain integers whose binary patterns meet some special forms; and the correctness of these properties is proved.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207168708803586