L-notation
Sign in to saveL-notation is an asymptotic notation analogous to big-O notation, denoted as L_n[\alpha,c] for a bound variable n tending to infinity. Like big-O notation, it is usually used to roughly convey the rate of growth of a function, such as the computational complexity of a particular algorithm.
~4 min read
Article
4 sectionsContents
- Definition
- Examples
- History
- References
L-notation is an asymptotic notation analogous to big-O notation, denoted as L_n[\alpha,c] for a bound variable n tending to infinity. Like big-O notation, it is usually used to roughly convey the rate of growth of a function, such as the computational complexity of a particular algorithm.
==Definition== It is defined as L_n[\alpha,c]=e^{(c+o(1))(\ln n)^\alpha(\ln\ln n)^{1-\alpha}}
Connections
time complexity
Entity
International Standard Book Number
Entity
algorithm
Entity
function
Entity
number theory
Entity
polynomial
Entity
limit
Entity
exponential function
Entity
elliptic curve
Entity
big O notation
Entity
computational complexity theory
Entity
integer factorization
Entity
primality test
Entity
discrete logarithm
Entity
AKS primality test
Entity
asymptotic analysis
Entity
computational number theory
Entity
general number field sieve
Entity
Carl Pomerance
Entity
sieve theory
Entity