Why do exponential-time algorithms become impractical even for moderately sized inputs?
The x-, y-, and z-axes correspond to components of the weather, while the graph indicates feasible weather patterns. The graph is a function of time, which means, in theory, that tracing the curve in one direction reveals past weather patterns, while tracing the curve in the other direction predicts future weather patterns. However, practically indistinguishable points may lead to completely different weather epochs, indicated by the two distinct “lobes.” This phenomenon, known as sensitivity to initial conditions, is what prevents precise weather forecasts more than a few days into the future.
Exponential-time algorithms become impractical for even moderately sized inputs because their execution time grows at an extremely rapid rate as the input size () increases.12
In computational complexity, algorithms are categorized by how their resource requirements scale. While problems solvable in polynomial time are considered efficient and tractable, those requiring exponential time are deemed intractable. For an algorithm with a complexity of , the number of operations required increases so sharply that even a computer capable of performing operations per second would struggle; for instance, while an input of might finish in less than a second, an input of could take over 40,000 years to complete.31
Because these intractable problems cannot be solved efficiently, computer scientists often rely on heuristic algorithms or approximation methods to find solutions that are reasonably close to optimal within a practical timeframe.32