Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color 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.

10 April 2023

15 February 2023

  • curprev 12:1612:16, 15 February 2023‎ Admin talk contribs‎ 298 bytes +298‎ Created page with "== Time Complexity == o(\exp({2}n^{1/2}\log^{2}n)) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://epubs.siam.org/doi/10.1137/0209018"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Babai_(Graph_Isomorphism,_Bounded_Number_of_Vertices_of_Each_Color_Graph_Isomorphism_Problem)"