Polynomial time, denoted as P, refers to the class of decision problems that can be solved by a deterministic Turing machine in a time that is a polynomial function of the size of the input. This means that as the input size grows, the time it takes to solve the problem grows at a rate that is considered manageable and efficient, making P problems tractable in practical computing scenarios.