算法
RT @MTHajiaghayi: Improved Graph Isomorphism result: continuing our work on this problem, we now present an algorithm running in n^O(log n) time, improving the best known exponent from 2 to 1! Graph Isomorphism now joins parity, mean-payoff, and stochastic games in this running-time class.