L-notation

L-notation is an asymptotic notation analogous to big-O notation, denoted as $L_{n}[\alpha ,c]$ $L_{n}[\alpha ,c]$ for a bound variable $n$ $n$ tending to infinity. Like big-O notation, it is usually used to roughly convey the computational complexity of a particular algorithm.

It is defined as

where c is a positive constant, and $\alpha$ $\alpha$ is a constant $0\leq \alpha \leq 1$ $0 \leq \alpha \leq 1$ .