D. P. McCarthy
Abstract
Open-access reader
The interaction between the efficiency of the basic multiplication algorithm and the addition chain used to compute ${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.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The interaction between the efficiency of the basic multiplication algorithm and the addition chain used to compute ${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.
Key concepts: Multiplication (music), Exponentiation, Mathematics, Multiplication algorithm, Arithmetic, Modular exponentiation, Algorithm, Combinatorics