Some algorithms on addition chains and their complexity
Matthijs J. Coster · Data Archiving and Networked Services (DANS) · 1990
Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use two new techniques. The first new technique involves a kind of addition chain graph, which is an important tool for studying the memory use in more detail. The second new technique concerns a way to split up the chains and sequences into subsets that can be studied independently