Numbers with Integer Complexity Close to the Lower Bound

DOI10.1515/integers-2012-0031zbMath1275.11019arXiv1207.4841OpenAlexW2963248707MaRDI QIDQ4902723

Harry Altman, Joshua Zelinsky

Publication date: 17 January 2013

Published in: Integers (Search for Journal in Brave)

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

zbMATH Keywords

arithmeticinteger sequenceinteger complexityarithmetic operations

Mathematics Subject Classification ID

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

Related Items (7)

Integer complexity: representing numbers of bounded defect ⋮ Integer complexity and well-ordering ⋮ 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

This page was built for publication: Numbers with Integer Complexity Close to the Lower Bound