Don Coppersmith, Prabhakar Raghavan, et al.
Information and Computation
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, Uzi Vishkin
Discrete Applied Mathematics
Alok Aggarwal, Don Coppersmith, et al.
SIAM Journal on Computing
Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms