It is quasi-polynomial, he asserts, which means that for a graph with n nodes, the algorithm’s running time is comparable to n raised not to a constant power (as in a polynomial) but to a power that ...

Kwan adds, "The graph isomorphism problem does not seem hard ... Babai made a breakthrough by proposing an algorithm that ...

"There are practical algorithms that work really well for ... can be compared in "quasi-polynomial time"—not polynomial time, but not bad. Here's a good thumbnail sketch of what an achievement ...

This research not only generalizes classical results ... This work highlights the potential for polynomial time algorithms to address problems that were previously thought to be intractable.

It is quasi-polynomial, he asserts, which means that for a graph with n nodes, the algorithm’s running time is comparable to n raised not to a constant power (as in a polynomial) but to a power ...

"There are practical algorithms that work really well for ... can be compared in "quasi-polynomial time"—not polynomial time, but not bad. Here's a good thumbnail sketch of what an achievement ...