
The interaction between the efficiency of the basic multiplication algorithm and the addition chain used to compute x n {x^n} is studied. We conclude that either repeated multiplication by x or repeated squaring should be used and the provenance of each technique is established.
Analysis of algorithms and problem complexity, multiplication chains, repeated multiplication, binary algorithm, Symbolic computation and algebraic computation, additon chains
Analysis of algorithms and problem complexity, multiplication chains, repeated multiplication, binary algorithm, Symbolic computation and algebraic computation, additon chains
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
