I have been working in the time analysis for an algorithm and finally I got a curve that fits:$O(2^{(\log_2(N)^{2.01})})$N is the number of elements.I'm right to say the above time complexity is quasi-polynomial?
Is this time complexity quasi-polynomial?
terminology;asymptotics;landau notation
Quasi-polynomial means different things to different people, but in many contexts it means a running time of the form $O(2^{O(\log^{O(1)} N)})$, to which your example conforms.