Exponential time refers to the computational complexity of an algorithm whose growth doubles with each addition to the input data set, making it impractical for large inputs. This is often contrasted with polynomial time, where the growth of the algorithm is more manageable as the input size increases.