Abstract:
Given two k element subsets in Z/nZ, we give a quasi-linear algorithm to either find x in (Z/nZ)*
such that S=xT or prove that no such x exists.
This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature.
Keywords: Circulant graphs; Graph isomorphism; Adam conjecture