Sub-exponential Algorithm

computation complexity

Definition

Sub-exponential Algorithm

A sub-exponential algorithm is an algorithm whose running time grows asymptotically slower than $c^n$ for every constant $c>1$.
Equivalently, its running time is $2^{o(n)}$.