L Auslander, E Feig, et al.
Advances in Applied Mathematics
In a universe of machines with n labeled states and p labeled inputs, it is shown that almost all machines have series-parallel decomposition if n and p approach infinity in such a way that pn1/2e-n→0. Also, almost all machines have no series-parallel decomposition if n and p approach infinity in such a way that pn1/6e-n→∞. © 1968 Academic Press Inc.
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Leo Liberti, James Ostrowski
Journal of Global Optimization
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Naga Ayachitula, Melissa Buco, et al.
SCC 2007