"The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*." - Bart Miller
In the realm of computer science and complexity theory, an algorithm's efficiency is often gauged by its ability to find solutions within a specified time frame