Sometimes problems can be solved in $O(n^c)$ time for any $c > 1$, but not for $c=1$. Typically this is written as $O(n^{1 + \epsilon})$, since $\epsilon$ is understood to be some small positive constant. I want to know the terminology for describing this complexity class.For example, I would call a $\Theta(n)$ algorithm linear. I would call a $\Theta(n^2)$ algorithms quadratic. I would call a $\Theta(n \cdot log^c(n))$ algorithm nearly linear. (Note that nearly linear is better than $O(n^{1+\epsilon})$.)What do I call algorithms that are in $O(n^{1+\epsilon})$?
What is the name for the complexity class $O(n^{1+\epsilon})$
terminology;asymptotics;landau notation