Quasi-polynomial time

In computational complexity theory and the analysis of algorithms, an algorithm is said to take quasi-polynomial time if its time complexity is quasi-polynomially bounded. That is, there should exist a constant ${\displaystyle c}$ such that the worst-case running time of the algorithm, on inputs of size ${\displaystyle n}$, has an upper bound of the form $${\displaystyle 2^{O{\bigl (}(\log n)^{c}{\bigr )}}.}$$

The decision problems with quasi-polynomial time algorithms are natural candidates for being NP-intermediate, neither having polynomial time nor likely to be NP-hard.