David Gamarnik, Moshe Lewenstein, et al.
Operations Research Letters
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.
David Gamarnik, Moshe Lewenstein, et al.
Operations Research Letters
Don Coppersmith
Journal of Cryptology
Don Coppersmith, Michael Elkin
SODA 2005
Don Coppersmith
Journal of Cryptology