scientific article; zbMATH DE number 4120283
From MaRDI portal
Publication:4733937
[For the entire collection see Zbl 0676.00005.] An addition chain for a given positive integer n is a sequence of integers \(1=a_ 0<a_ 1<...<a_ r=n\), where for each \(i>0\) the element \(a_ i\) is a sum of \(a_ j+a_ k\) with \(j,k<i\) and \(j=k\) is allowed. The smallest value of r for which there is an additive chain for n is denoted by \(\ell (n)\). The author gives some results and unsolved problems concerning \(\ell (n)\) and related functions. Some generalizations of addition chains are also considered.
Recommendations
- Some results on addition/subtraction chains
- A study of some addition chain problems
- On Addition Chains1
- Shorter Notes: A Note on Addition Chains
- scientific article; zbMATH DE number 5968524
- Some results for some conjectures in addition chains
- On a generalization of addition chains: addition-multiplication chains
- scientific article; zbMATH DE number 4136062
- On generalized addition chains
- A generalization of the Lucas addition chains
Cited in
(28)- Some results on addition/subtraction chains
- Integers with a small number of minimal addition chains
- Addition chains -- an erratic sequence
- Internal structure of addition chains: well-ordering
- On Bellman's and Knuth's problems and their generalizations
- Chain addition cycles
- Addition chains, vector chains, and efficient computation
- Integer complexity: the integer defect
- On a generalization of addition chains: addition-multiplication chains
- Some results for some conjectures in addition chains
- scientific article; zbMATH DE number 5968524 (Why is no real title available?)
- A Conjecture in Addition Chains Related to Scholz's Conjecture
- Minimizing sums of addition chains
- Integer complexity: representing numbers of bounded defect
- scientific article; zbMATH DE number 4136062 (Why is no real title available?)
- scientific article; zbMATH DE number 4035133 (Why is no real title available?)
- A study of some addition chain problems
- On Addition Chains1
- Generating units modulo an odd integer by addition and subtraction
- On extensions of 1 chains
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- Efficient generation of shortest addition-multiplication chains
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
- Integer complexity: algorithms and computational results
- On generalized addition chains
- Remarks on number theory III. On addition chains
- Star reduction among minimal length addition chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733937)