Definition: The measure of computation, m(n) (usually execution time or memory space), is more than any polynomial nk, but less than any exponential cn where c > 1. Formally, m(n) is of moderately exponential growth if ∀ k > 0 m(n)=Ω(nk) and ∀ ε > 0 m(n)=o((1+ε)n).
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue Feb 12 10:57:43 2019.
Cite this as:
Paul E. Black, "moderately exponential", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/moderatexpon.html