Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)

From Algorithm Wiki

Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $exp(O(k^{2} \sqrt{n})$ == Space Complexity == check words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://oa.mg/work/10.1109/focs.2008.80")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$exp(O(k^{2} \sqrt{n})$

Space Complexity

check words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2008

Reference

https://oa.mg/work/10.1109/focs.2008.80

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Babai_%26_Codenotti_(Hypergraphs_isomorphism_Graph_Isomorphism_Problem)&oldid=45472"