In the first of several talks on his new algorithm, on November 10, Babai called these Johnson graphs “a source of just unspeakable misery” to computer scientists working on painting schemes for the ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

“We had to control how big a number shows up as we do this guessing and coordination,” said Peng. Peng and Vempala prove that their algorithm can solve any sparse linear system in n 2.332 steps. This ...