Babai’s result presents an algorithm that solves graph isomorphism in a “quasi-polynomial” amount of time. Very roughly speaking, his algorithm carries the graph isomorphism problem almost all the way ...

Kwan adds, "The graph isomorphism problem does not seem hard, but we somehow can't yet prove that it's easy." The complexity of modeling networks.

The graph isomorphism problem is neither known to be in P nor known to be NP-complete; instead, it seems to hover between the two categories. It is one of only a tiny handful of natural problems that ...

Kwan adds, "The graph isomorphism problem does not seem hard, but we somehow can't yet prove that it's easy." The complexity of modeling networks.

Graph isomorphism in quasipolynomial time I: The “Local Certificates Algorithm.” Combinatorics and Theoretical Computer Science seminar, Chicago, November 10, 2015.

--MicroAlgo Inc.,, today announced the introduction of an innovative solution: a multi-simulator collaborative algorithm based on subgraph isomorphism, aimed at overcoming the limitations of qubit ...