Category:Exponential Time

This category contains results about Exponential Time.
Definitions specific to this category can be found in Definitions/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.