It might turn out that a P algorithm capable of solving the NP-complete problem is on a time scale of, say, n^100. “Technically that falls under P: it’s a polynomial,” says James.

Finding fast algorithms for these NP-complete problems (or proving that no such algorithms exist) would resolve the “P versus NP” question, which is the most important mystery in computer science.