Superpolynomial time is a computation time that grows faster than every fixed power of the input size.
For an eventually positive running-time function 
, where 
is the input length, this means
 |
for every fixed constant 
(Arora and Barak 2009, Skulrattanakulchai 2021). In little-omega notation, this is 
for every fixed 
.
Superpolynomial growth need not be exponential growth. For example, 
grows faster than every fixed power
of 
,
but more slowly than 
for every fixed 
. This example also has quasipolynomial
time growth.
