# Difference between computational complexities in General Number Field Sieve

I'm told that General Number Field Sieve works with computational complexity $e^{\sqrt{\frac{64}{9}+o(1)}\;(\ln n)^{\frac{1}{3}}\;(\ln\ln n)^{\frac{2}{3}}}$. However, without some computation work it should run with computational complexity $e^{\sqrt{3+o(1)}\;(\ln n)^{\frac{1}{3}}\;(\ln\ln n)^{\frac{2}{3}}}$.

This does not seem to be as a big difference but according to the following table it is: How can be the difference so huge if only a constant changes?

By moving the $o(1)$ and using elementary algebra, the formulas given can be rewritten with a single digit difference, as $$\left(e^{(3^{-2/3})\;(\ln n)^{\frac{1}{3}}\;(\ln\ln n)^{\frac{2}{3}}}\right)^{4+o(1)}\;\text{ and }\;\left(e^{(3^{-2/3})\;(\ln n)^{\frac{1}{3}}\;(\ln\ln n)^{\frac{2}{3}}}\right)^{3+o(1)}$$
2. The $o(1)$ beats any outer multiplicative factor, and the formulas are thus missing some unknown, possibly large multiplicative factor when we use them for any particular $n$. This explains why we can at best use the formulas to predict approximately how the run time of each of the attacks (or the ratio of the two run times) scales with $n$ (and then, not rigorously); but not to quantitatively predict the relative runtime of the two algorithms for some $n$.