1.Previous
3.Next

equivalent to the graph isomorphism problem, and therefore solvable in quasi-polynomial time, that is with running time for some fixed .Consequently, like the graph isomorphism problem, the problem of finding a graph's automorphism group is known to belong to the complexity class NP, but not known to be in P nor to be

1.Previous
3.Next