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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics Jg. 22; H. 2; S. 117 - 134
Hauptverfasser:	Tsai, Y.H., Chin, Y.H.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Gordon and Breach Science Publishers 01.01.1987
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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