(definition)

**Definition:**
The measure of computation, m(n) (usually execution time or memory space), is more than any *polynomial* n^{k}, but less than any *exponential* c^{n} where c > 1. Formally, m(n) is of moderately exponential growth if ∀ k > 0 m(n)=*Ω(n ^{k})* and ∀ ε > 0 m(n)=

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.

HTML page formatted Mon Feb 2 13:10:40 2015.

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: http://www.nist.gov/dads/HTML/moderatexpon.html