Polynomial time refers to the class of computational problems for which the time required to solve the problem using an algorithm is a polynomial function of the size of the input. This is significant in computer science because problems solvable in polynomial time are considered efficiently solvable or 'tractable'.