# NP-complete

An NP problem is an algorithmic problem such that if you have a case of the problem of size ${\displaystyle n}$, the number of steps needed to check the answer is smaller than the value of some polynomial in ${\displaystyle n}$. It doesn't mean one can find an answer in the polynomial number of steps, only check it.