Quasipolynomial time is a bound on the computation time of an algorithm of the form
 |
where 
is the input length and 
is a fixed constant. The
is big-O notation. Polynomial
time is included by taking 
. For example, 
is quasipolynomial but grows faster than
every fixed power of 
.
Parity games admit algorithms with quasipolynomial computation time (Jurdziński and Lazić 2018).
