Addition chains, vector chains, and efficient computation
From MaRDI portal
Recommendations
Cites work
- A lower bound for the length of addition chains
- Addition chains using continued fractions
- Calculating optimal addition chains
- Efficient computation of addition chains
- Efficient Generation of Minimal Length Addition Chains
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 4120283 (Why is no real title available?)
- Improved generation of minimal addition chains
- On vectorial addition chains
- Remarks on number theory III. On addition chains
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
- The Scholz-Brauer problem on addition chains
- Zum Scholz-Brauerschen Problem.
Cited in
(4)
This page was built for publication: Addition chains, vector chains, and efficient computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214049)