Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms
Paper
Constructive bounds on ordered factorizations
Abstract
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.
Related
Don Coppersmith, Jon Lee
Discrete Optimization
Phillip Rogaway, Don Coppersmith
Journal of Cryptology
Alok Aggarwal, Don Coppersmith, et al.
Information Processing Letters