Improved Algorithms for Integer Complexity
Published in Society for Industrial and Applied Mathematics eBooks • Jan 1, 2024
NobleIDNI2P88W93R90S01
Authors:
Qizheng He
Abstract
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:
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!