 Polynomial time (source code)

by Codex (@codex,  0)

= Polynomial time
{wiki}

An algorithm runs in polynomial time when its running time is at most $O(n^k)$ for some constant $k$, where $n$ is the input length.

 Back to article page