# If $n^{\log n}$ is not polynomial or exponential, then what this function is called?

I just found this sentence on page 6 of Garey and Johnson's "Computers and Intractability".

Any algorithm whose time complexity function cannot be so bounded is called an exponential time algorithm (although it should be noted that this definition includes certain non-polynomial time complexity functions, like $n^{\log n}$, which are not normally regarded as exponential functions).

My question as following,

If $n^{\log n}$ is not polynomial nor exponential, then what this function is called? Does this have a name or special cases or not?

Thank you.

• @user777 I think subexponential is of form $$c^{n^{\frac1{1+\gamma}}}$$ while superpolynomial or quasipolynomial is of form $$c^{\log^{1+\gamma} n}$$ with $c,\gamma>0$ remaining fixed – user39969 Nov 21 '15 at 20:46