Papers › Improved Algorithms for Integer Complexity
Improved Algorithms for Integer Complexity
Qizheng He
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The integer complexity f(n) of a positive integer n is defined as the minimum number of 1's needed to represent n, using additions, multiplications and parentheses. We present two simple and faster algorithms for computing the integer complexity: 1) A near-optimal O(Npolylog N)-time algorithm for computing the integer complexity of all n≤N, improving the previous O(N^(1.223)) one [Cordwell et al., 2017]. 2) The first sublinear-time algorithm for computing the integer complexity of a single n, with running time O(n^(0.6154)). The previous algorithms for computing a single f(n) require computing all f(1),…,f(n).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections