| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431171 | Journal of Discrete Algorithms | 2006 | 12 Pages |
Abstract
Given two k element subsets S,T⊆ZnS,T⊆Zn, we give a quasi-linear algorithm to either find λ∈Zn∗ such that S=λTS=λ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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyê˜n, Igor E. Shparlinski,