## Computational complexity with an epsilon

What does that mean when there's an $\epsilon$ in the complexity, such as
$O(n^{2+\epsilon})$ for every $\epsilon >0$
 PhysOrg.com science news on PhysOrg.com >> City-life changes blackbird personalities, study shows>> Origins of 'The Hoff' crab revealed (w/ Video)>> Older males make better fathers: Mature male beetles work harder, care less about female infidelity

Recognitions:
Homework Help
 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})$.

 Similar discussions for: Computational complexity with an epsilon Thread Forum Replies Career Guidance 11 General Physics 0 General Math 1 Programming & Comp Sci 3 General Math 3