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 ...
In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...
The fraternity of problems that confound computers has lost a prominent member. Computer scientist László Babai presented a new algorithm this year that efficiently tackles the graph isomorphism ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback