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 c {\displaystyle c} such that the worst-case running time of the algorithm, on inputs of size n {\displaystyle n} , has an upper bound of the form 2 O ( ( log n ) c ) .
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 c {\displaystyle c} such that the worst-case running time of the algorithm, on inputs of size n {\displaystyle n} , has an upper bound of the form 2 O ( ( log n ) c ) .
Source: Wikipedia "Quasi-polynomial time" · CC BY-SA 4.0
Share this article: X · Bluesky