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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 22; číslo 2; s. 117 - 134
Hlavní autoři:	Tsai, Y.H., Chin, Y.H.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Gordon and Breach Science Publishers 01.01.1987
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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