Hmm, interesting in the notation that Scott says is standard to complexity theory my earlier statement that factoring is "subexponential" is wrong even though it is slower growing than exponential. But apparently Greg Kuperberg is perfectly happy labeling something like 2^(n^(1/2)) as subexponential.