Nikhil Bansal, Danny Z. Chen, et al.
Algorithmica (New York)
Given two k element subsets S, T ⊆ Zn, we give a quasi-linear algorithm to either find λ ∈ Zn* such that S = λ T or prove that no such λ exists. This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature. © 2005 Elsevier B.V. All rights reserved.
Nikhil Bansal, Danny Z. Chen, et al.
Algorithmica (New York)
Don Coppersmith, Igor Pak
Probability Theory and Related Fields
Don Coppersmith, Michel Petitjean
Comptes Rendus Mathematique
Don Coppersmith, Alan J. Hoffman
Linear Algebra and Its Applications