Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.
- Circulant combinatorial object
- Graph isomorphism problem
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics