The straight line complexity of small factorials and primorials
classification
💻 cs.CC
cs.DMmath.NT
keywords
complexitystraight-lineboundsdeterminecomplexitiescomputerexhaustivefactorials
read the original abstract
In this paper we determine the straight-line complexity of $n!$ for $n\leq 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\leq 43$. Our results are based on an exhaustive computer search of the short length straight-line programs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.