Category:Definitions/Exponential Time

This category contains definitions related to Exponential Time.
Related results can be found in Category:Exponential Time.

Exponential time is a measure of algorithmic complexity.

An algorithm runs in exponential time if and only if it does not run in polynomial time.

That is, if and only if there do not exist integers $A$ and $k$ such that, for $n$ inputs, the algorithm terminates in no more than $A n^k$ steps.