Polynomial time complexity refers to an algorithm whose running time grows at a polynomial rate with respect to the input size, typically denoted as O(n^k) where n is the input size and k is a constant. It is considered efficient and feasible for computation, as opposed to exponential time complexity which grows much faster and is often impractical for large inputs.