Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
o(\exp({2}n^{1/2}\log^{2}n))
Space Complexity
$O(n^{2})$ words
(https://epubs.siam.org/doi/10.1137/0209018 (section 2.5))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1980