Maria-Florina Balcan, Nikhil Bansal, et al.
Machine Learning
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.
Maria-Florina Balcan, Nikhil Bansal, et al.
Machine Learning
Don Coppersmith, David Gamarnik, et al.
SODA 2002
Don Coppersmith, Lisa Fleischer, et al.
SODA 2006
Dario Catalano, Rosario Gennaro, et al.
Journal of Cryptology