Define the complexity class P.

Answer

P = the set of decision problems (languages) decidable by a polynomial-time algorithm, i.e. in O(n^k) time for some constant k.

P formalizes "tractable": some single algorithm answers yes/no in time bounded by a fixed polynomial in the input size n.