P is the class of problems which can be solved by algorithms whose run time is bounded by a polynomial.