Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem)
Jump to navigation
Jump to search
Time Complexity
$n^{O(n^{({1}/{3})} log n)}$
Space Complexity
check words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1996