21 citations · 37 across the 10 of their papers we have counts for
1 paper · 1 filter
Klas Markström
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 com…