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.