A Conjecture in Addition Chains Related to Scholz's Conjecture

DOI10.2307/2152933MaRDI QIDQ3137445zbMATH OpenOpenAlexWikidataFDO

Authors Walter G. Aiello, M. V. Subbarao

Publication date 23 January 1994

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2152933

zbMATH Keywords

algorithmslengthScholtz's conjectureshortest addition chain

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Calculation of integer sequences (11Y55)

Recommendations

• Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
• scientific article; zbMATH DE number 1665443
• Calculating optimal addition chains
• scientific article; zbMATH DE number 4120283
• scientific article; zbMATH DE number 4136062

Cited in

(6)

• scientific article; zbMATH DE number 1665443 (Why is no real title available?)
• scientific article; zbMATH DE number 4136062 (Why is no real title available?)
• Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
• A Note on Infinite Antichain Density
• The Scholz conjecture on addition chain is true for infinitely many integers with \ell(2n)= \ell(n)
• Calculating optimal addition chains

This page was built for publication: A Conjecture in Addition Chains Related to Scholz's Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137445)