# Babai ( Graph Isomorphism Problem)

Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == {2}^{$O(\log n)$^3} == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2017 == Reference == http://people.cs.uchicago.edu/~laci/update.html, http://people.cs.uchicago.edu/~laci/17groups/version2.1.pdf")

## Time Complexity

{2}^{$O(\log n)$^3}

## Space Complexity

()

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

## Year

2017

## Reference

http://people.cs.uchicago.edu/~laci/update.html, http://people.cs.uchicago.edu/~laci/17groups/version2.1.pdf