Explore relationships

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.

Use + to expand a branch. Click a topic name to open its summary.