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

big-o, complexity-theory, math

Solution

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

Problem

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.

Original source