Polynomial time

We say that the runtime of an algorithm is polynomial if its runtime is $𝑓\left(𝑛\right)\in 𝑂\left({𝑛}^{𝑘}\right)$ for some fixed $𝑘$.