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

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

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

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

For decades, the graph isomorphism problem has held a special status within complexity theory ... what he asserts is a “quasi-polynomial-time” algorithm to solve it. As Aaronson describes ...