Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://www.cs.yale.edu/homes/spielman/PAPERS/srg.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

https://www.cs.yale.edu/homes/spielman/PAPERS/srg.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Spielman_(Isomorphism_of_strongly_regular_graphs_Graph_Isomorphism_Problem)&oldid=45467"