When I read papers in theoretical computer science, I see the notation $probability<2^{-\Omega(n)}$ to denote the probability.
My queestion is
What Does $\Omega$ mean? Is it the same as in complexity theory?
Example1:
https://arxiv.org/pdf/1211.7184.pdf . The last sentence of the Theorem 2.
Example2:
$1-e^{-1/3}-e^{-\Omega(n)}=\Omega(1)$.
page 40 in https://link.springer.com/book/10.1007/978-3-642-16544-3
