For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...
5monon 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 ...
Racks and quandles are prominent set-theoretical solutions of the Yang-Baxter equation. We enumerate racks and quandles of orders 𝑛 ≤ 13 up to isomorphism, improving upon the previously known results ...
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 ...
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback