Don Coppersmith, Nick Howgrave-Graham, et al.
Journal of Discrete Algorithms
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions. © 2005 Society for Industrial and Applied Mathematics.
Don Coppersmith, Nick Howgrave-Graham, et al.
Journal of Discrete Algorithms
Amihood Amir, Richard Cole, et al.
Information and Computation
Robert Cimikowski, Don Coppersmith
Discrete Mathematics
Amihood Amir, Dmitry Keselman, et al.
Journal of Algorithms