Hosted on MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...
Just five days after posting a retraction, László Babai announced that he had fixed the error in his landmark graph isomorphism algorithm. The back and forth ...
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 ...
A lot happened in mathematics this year. High school exam problems went viral. Terry Tao solved the Erdös Discrepancy Problem and while most mathematicians would have submitted the paper to a top math ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results