Complexity Class $\mathsf{P}$

The decision problems that have a polynomial-time algorithm, i.e. an algorithm that answers every instance $x$ in $O(|x|^k)$ steps, for a fixed constant $k$.