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ⁿ where c > 1. Formally, m(n) is of moderately exponential growth if ∀ k > 0 m(n)=Ω(n^k) and ∀ ε > 0 m(n)=o((1+ε)ⁿ).