View source for Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)

← Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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

Return to Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Babai_%26_Codenotti_(Hypergraphs_isomorphism_Graph_Isomorphism_Problem)"

Navigation menu