A short note on integer complexity

MaRDI QIDQ5499958zbMATH OpenFDO

Authors Stefan Steinerberger

Publication date 5 August 2015

Mathematics Subject Classification ID

Symbolic dynamics (37B10)

Recommendations

• Integer complexity: experimental and analytical results. II
• On algorithms to calculate integer complexity
• Numbers with integer complexity close to the lower bound
• Integer complexity: the integer defect
• Integer complexity: algorithms and computational results

Cited in

(8)

• A Short Introduction to Implicit Computational Complexity
• On algorithms to calculate integer complexity
• Integer complexity: algorithms and computational results
• Integer complexity: experimental and analytical results. II
• scientific article; zbMATH DE number 7663176 (Why is no real title available?)
• The 2-complexity of even positive integers
• A binary version of the Mahler-Popken complexity function
• Revisiting How Many 1’s Are Needed

This page was built for publication: A short note on integer complexity

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