Efficient generation of shortest addition-multiplication chains
From MaRDI portal
Publication:5220293
Recommendations
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 4120283 (Why is no real title available?)
- A Survey of Fast Exponentiation Methods
- A fast parallel modular exponentiation algorithm
- A new strategy for generating shortest addition sequences
- Addition Chain Methods for the Evaluation of Specific Polynomials
- Complexity measures and hierarchies for the evaluation of integers and polynomials
- Computing Sequences with Addition Chains
- Efficient Generation of Minimal Length Addition Chains
- Improved generation of minimal addition chains
- Integers with a small number of minimal addition chains
- On a generalization of addition chains: addition-multiplication chains
- Star reduction among minimal length addition chains
Cited in
(9)- scientific article; zbMATH DE number 1946632 (Why is no real title available?)
- A new strategy for generating shortest addition sequences
- Improved generation of minimal addition chains
- On the construction of short addition-subtraction chains and their applications
- Addition chains meet postage stamps: reducing the number of multiplications
- On a generalization of addition chains: addition-multiplication chains
- Efficient computation of addition chains
- scientific article; zbMATH DE number 7235119 (Why is no real title available?)
- Some properties of vectorial addition chains†
This page was built for publication: Efficient generation of shortest addition-multiplication chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220293)