3 citations · 7 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.NT2016★ 3 cited
Integer complexity: algorithms and computational results
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. Define to be stable i…
math.NT2016
Integer Complexity: Representing Numbers of Bounded Defect
Harry Altman
Define to be the complexity of , the smallest number of ones needed to write using an arbitrary combination of addition and multiplication. John Selfridge showed tha…