# Computational complexity with an epsilon

by yavanna
Tags: complexity, computational, epsilon
 P: 12 What does that mean when there's an $\epsilon$ in the complexity, such as $O(n^{2+\epsilon})$ for every $\epsilon >0$
HW Helper
P: 6,189
 Quote by yavanna What does that mean when there's an $\epsilon$ in the complexity, such as $O(n^{2+\epsilon})$ for every $\epsilon >0$
Welcome to PF, yavanna!

I would tend to take it very literally.
It says the complexity is greater than $O(n^{2})$.
But it is less than for instance $O(n^{2.1})$.

Note that a complexity of $O(n^{3})$ as well as $O(n^{4})$ implies a complexity of $O(n^{3})$.

 Related Discussions Career Guidance 11 General Physics 0 General Math 1 Programming & Computer Science 3 General Math 3