A binary version of the Mahler-Popken complexity function

MaRDI QIDQ6943854zbMATH OpenFDO

Authors John Maxwell Campbell

Publication date 12 August 2025

Published in Integers (Search for Journal in Brave)

Full work available at URL https://math.colgate.edu/~integers/y94/y94.pdf

zbMATH Keywords

addition chainsinteger complexity

Mathematics Subject Classification ID

Other number representations (11A67)

Cites work

• A short note on integer complexity
• Complexity of natural numbers
• scientific article; zbMATH DE number 6696432 (Why is no real title available?)
• scientific article; zbMATH DE number 4097467 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 3080556 (Why is no real title available?)
• Integer complexity and well-ordering
• Integer complexity: algorithms and computational results
• Integer complexity: experimental and analytical results. II
• Integer complexity: representing numbers of bounded defect
• Integer complexity: the integer defect
• Numbers with integer complexity close to the lower bound
• On addition chains
• On algorithms to calculate integer complexity

This page was built for publication: A binary version of the Mahler-Popken complexity function

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