Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.