The 'P Class' in computational complexity theory refers to the set of decision problems that can be solved by a deterministic Turing machine in polynomial time, which means the time taken to solve these problems grows at a polynomial rate relative to the input size. It is a fundamental class that helps distinguish between problems that are efficiently solvable and those that may not be, serving as a benchmark for comparing the complexity of different computational problems.