Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1612:16, 15 February 2023‎ Admin talk contribs‎ 315 bytes +315‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Spielman_(Isomorphism_of_strongly_regular_graphs_Graph_Isomorphism_Problem)"