The straight line complexity of small factorials and primorials
Abstract
In this paper we determine the straight-line complexity of n! for n≤ 22 and give bounds for the complexities up to n=46. In the same way we determine the straight-line complexity of the product of the first primes up to p=31 and gives bounds for p≤ 43. Our results are based on an exhaustive computer search of the short length straight-line programs.
0