A run time for an algorithm that doesn't increase faster than a polynomial function of the input size (like 10 � 10n10, n, � 2 n 2 n, squared, etc). An unreasonable run time would increase super polynomially (like 2 � 2 n 2, start superscript, n, end superscript, or � ! n! n, !).