Last year, Laszlo Babai proved that the graph isomorphism problem can be solved in time:

$$ O(\exp(\log^c n)) $$

where $n$ is the number of vertices.

What is the best bound we have for $c$? (The case $c = 1$ would correspond to a polynomial-time algorithm for graph isomorphism.)

Last year, Laszlo Babai proved that the graph isomorphism problem can be solved in time:

$$ \exp(O(\log^c n)) $$

where $n$ is the number of vertices.

What is the best bound we have for $c$? (The case $c = 1$ would correspond to a polynomial-time algorithm for graph isomorphism.)