17 citations · 41 across the 14 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2014
Integer Complexity: Experimental and Analytical Results II
Juris Čerņenoks, Jānis Iraids, Mārtiņš Opmanis +2
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. denotes the minimum number of 1's in the expres…
math.NT2012★ 1 cited
Integer Complexity: Experimental and Analytical Results
Jānis Iraids, Kaspars Balodis, Juris Čerņenoks +3
We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- i…