In practice, existing algorithms can do the job in reasonable time, but it was possible that extremely complex graphs would make the problem intractable. Not anymore. “My first thought was that ...

(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 ...

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. “In Laci Babai, you have one of the most legendary and fearsome theoretical computer scientists there ever ...