Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing ...

(January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm runs in quasi-polynomial time and then five ... For decades, the graph isomorphism problem has held a special ...