Integer complexity: algorithms and computational results

zbMath1448.11019arXiv1606.03635MaRDI QIDQ5384256

Harry Altman

Publication date: 21 June 2019

Full work available at URL: https://arxiv.org/abs/1606.03635

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other number representations (11A67)

Related Items (1)

On algorithms to calculate integer complexity

Cites Work

• Integer complexity: representing numbers of bounded defect
• Integer complexity and well-ordering
• Internal structure of addition chains: well-ordering
• Characterizing Arithmetic Read-Once Formulae
• Numbers with Integer Complexity Close to the Lower Bound
• Integer Complexity: Experimental and Analytical Results II
• On addition chains
• Arithmetic of ordinals with applications to the theory of ordered Abelian groups
• Unsolved problems in number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer complexity: algorithms and computational results