# Computational complexity with an epsilon

1. Aug 22, 2011

### yavanna

What does that mean when there's an $\epsilon$ in the complexity, such as
$O(n^{2+\epsilon})$ for every $\epsilon >0$

2. Aug 27, 2011

### I like Serena

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})$.

Last edited: Aug 27, 2011