Definition: (1) Any function which is the sum of constants times other constants to the power of the argument: f(x)=Σi=0k cibixpi. (2) In complexity theory, the measure of computation, m(n) (usually execution time or memory space), is bounded by an exponential function of the problem size, n. More formally if there exists k > 1 such that m(n) = Θ(kn) and there exists c such that m(n) = O(cn).
See also logarithmic, linear, polynomial, moderately exponential.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "exponential", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/exponential.html