Babai ( Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
{2}^{$O(\log n)$^3}
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2017
Reference
http://people.cs.uchicago.edu/~laci/update.html, http://people.cs.uchicago.edu/~laci/17groups/version2.1.pdf