Integer complexity and well-ordering

DOI10.1307/mmj/1441116656zbMath1371.11014arXiv1310.2894OpenAlexW2963934556MaRDI QIDQ887902

Harry Altman

Publication date: 3 November 2015

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

complexitydefectaddition chain lengthwell order

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Other number representations (11A67)

Related Items (6)

Integer complexity: representing numbers of bounded defect ⋮ Internal structure of addition chains: well-ordering ⋮ On algorithms to calculate integer complexity ⋮ Integer complexity: algorithms and computational results ⋮ Integer complexity: the integer defect ⋮ Integer Complexity: Experimental and Analytical Results II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds in algebraic computational complexity
• Negation can be exponentially powerful
• A lower bound on the number of additions in monotone computations
• Some Exact Complexity Results for Straight-Line Computations over Semirings
• Numbers with Integer Complexity Close to the Lower Bound
• The Extraordinary Power of Division in Straight Line Programs
• Integer Complexity: Experimental and Analytical Results II
• On A Problem of P. Erdos
• Arithmetic of ordinals with applications to the theory of ordered Abelian groups
• Subtraction-free complexity, cluster transformations, and spanning trees

This page was built for publication: Integer complexity and well-ordering