P is the [problem_class class of problems] which can be solved by [algorithm algorithms] whose run time is bounded by a [-polynomial].
https://arbital.com/p/polynomial_time_complexity_class
by Eric Leese Jul 31 2016 updated Aug 2 2016
P is the class of problems which can be solved by algorithms whose run time is bounded by a polynomial.
P is the [problem_class class of problems] which can be solved by [algorithm algorithms] whose run time is bounded by a [-polynomial].