What does Õ (omicron tilde) mean in complexity Õ(n

问题:

I've never seen this notation for complexity: Õ(n).

It comes up in the context of learning in stochastic algorithms.

Anyone know this notation? You can't exactly google this...

EDIT: SOLVED

I think people have pointed out the right answer below. In my case Õ() is used to hide an exponential growth of a tree.

回答1:

It is shorthand for O(g(n) log^k g(n))

回答2:

Actually, you can google this!

It is a variant of big-O that ignores logarithmic factors. See this wikipedia entry, which I found simply by googling that character and looking at the top entry.