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

In the summer of 2016, Andoni, Nikolov, Razenshteyn and Waingarten knew that good nearest neighbor algorithms were impossible for expander graphs. But what they really wanted to prove was that good ...

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do so for some critical optimization tasks.